./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c --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/weaver/popl20-simple-array-sum.wvr.c -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 eecffe8522a4364afb75ce7fb01800caae42a8a3ed11b56f212b94255e6f04bc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 20:22:27,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 20:22:27,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 20:22:27,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 20:22:27,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 20:22:27,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 20:22:27,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 20:22:27,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 20:22:27,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 20:22:27,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 20:22:27,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 20:22:27,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 20:22:27,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 20:22:27,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 20:22:27,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 20:22:27,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 20:22:27,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 20:22:27,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 20:22:27,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 20:22:27,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 20:22:27,188 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 20:22:27,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 20:22:27,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 20:22:27,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 20:22:27,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 20:22:27,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 20:22:27,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 20:22:27,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 20:22:27,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 20:22:27,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 20:22:27,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 20:22:27,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 20:22:27,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 20:22:27,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 20:22:27,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 20:22:27,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 20:22:27,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 20:22:27,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 20:22:27,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 20:22:27,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 20:22:27,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 20:22:27,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 20:22:27,228 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-04-18 20:22:27,244 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 20:22:27,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 20:22:27,246 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 20:22:27,246 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 20:22:27,247 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 20:22:27,247 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 20:22:27,247 INFO L138 SettingsManager]: * User list type=DISABLED [2022-04-18 20:22:27,247 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-04-18 20:22:27,248 INFO L138 SettingsManager]: * Explicit value domain=true [2022-04-18 20:22:27,248 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-04-18 20:22:27,248 INFO L138 SettingsManager]: * Octagon Domain=false [2022-04-18 20:22:27,249 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-04-18 20:22:27,249 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-04-18 20:22:27,249 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-04-18 20:22:27,249 INFO L138 SettingsManager]: * Interval Domain=false [2022-04-18 20:22:27,250 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-04-18 20:22:27,250 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-04-18 20:22:27,250 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-04-18 20:22:27,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 20:22:27,252 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 20:22:27,252 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 20:22:27,252 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 20:22:27,252 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 20:22:27,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 20:22:27,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 20:22:27,253 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 20:22:27,253 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 20:22:27,253 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 20:22:27,254 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 20:22:27,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 20:22:27,254 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 20:22:27,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 20:22:27,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 20:22:27,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 20:22:27,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 20:22:27,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 20:22:27,255 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 20:22:27,255 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 20:22:27,256 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-04-18 20:22:27,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 20:22:27,256 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 20:22:27,256 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-18 20:22:27,256 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-18 20:22:27,256 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 -> eecffe8522a4364afb75ce7fb01800caae42a8a3ed11b56f212b94255e6f04bc [2022-04-18 20:22:27,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 20:22:27,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 20:22:27,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 20:22:27,443 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 20:22:27,444 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 20:22:27,445 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2022-04-18 20:22:27,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d17fc701e/db4fb3ac63e441d38014953d64faeb8a/FLAG590bf8f18 [2022-04-18 20:22:27,864 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 20:22:27,864 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2022-04-18 20:22:27,872 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d17fc701e/db4fb3ac63e441d38014953d64faeb8a/FLAG590bf8f18 [2022-04-18 20:22:27,894 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d17fc701e/db4fb3ac63e441d38014953d64faeb8a [2022-04-18 20:22:27,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 20:22:27,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 20:22:27,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 20:22:27,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 20:22:27,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 20:22:27,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 08:22:27" (1/1) ... [2022-04-18 20:22:27,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da68547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:22:27, skipping insertion in model container [2022-04-18 20:22:27,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 08:22:27" (1/1) ... [2022-04-18 20:22:27,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 20:22:27,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 20:22:28,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c[2690,2703] [2022-04-18 20:22:28,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 20:22:28,124 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 20:22:28,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c[2690,2703] [2022-04-18 20:22:28,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 20:22:28,163 INFO L208 MainTranslator]: Completed translation [2022-04-18 20:22:28,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:22:28 WrapperNode [2022-04-18 20:22:28,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 20:22:28,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 20:22:28,165 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 20:22:28,165 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 20:22:28,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:22:28" (1/1) ... [2022-04-18 20:22:28,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:22:28" (1/1) ... [2022-04-18 20:22:28,213 INFO L137 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 172 [2022-04-18 20:22:28,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 20:22:28,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 20:22:28,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 20:22:28,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 20:22:28,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:22:28" (1/1) ... [2022-04-18 20:22:28,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:22:28" (1/1) ... [2022-04-18 20:22:28,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:22:28" (1/1) ... [2022-04-18 20:22:28,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:22:28" (1/1) ... [2022-04-18 20:22:28,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:22:28" (1/1) ... [2022-04-18 20:22:28,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:22:28" (1/1) ... [2022-04-18 20:22:28,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:22:28" (1/1) ... [2022-04-18 20:22:28,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 20:22:28,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 20:22:28,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 20:22:28,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 20:22:28,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:22:28" (1/1) ... [2022-04-18 20:22:28,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 20:22:28,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:22:28,326 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 20:22:28,331 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 20:22:28,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 20:22:28,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 20:22:28,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 20:22:28,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-18 20:22:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-04-18 20:22:28,352 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-04-18 20:22:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-04-18 20:22:28,352 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-04-18 20:22:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-04-18 20:22:28,352 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-04-18 20:22:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 20:22:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-04-18 20:22:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-04-18 20:22:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-18 20:22:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 20:22:28,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 20:22:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 20:22:28,353 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 20:22:28,428 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 20:22:28,429 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 20:22:28,790 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 20:22:28,864 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 20:22:28,864 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-18 20:22:28,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 08:22:28 BoogieIcfgContainer [2022-04-18 20:22:28,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 20:22:28,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 20:22:28,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 20:22:28,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 20:22:28,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 08:22:27" (1/3) ... [2022-04-18 20:22:28,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c5d6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 08:22:28, skipping insertion in model container [2022-04-18 20:22:28,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:22:28" (2/3) ... [2022-04-18 20:22:28,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c5d6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 08:22:28, skipping insertion in model container [2022-04-18 20:22:28,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 08:22:28" (3/3) ... [2022-04-18 20:22:28,876 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2022-04-18 20:22:28,884 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 20:22:28,884 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 20:22:28,884 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-04-18 20:22:28,884 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 20:22:28,944 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-04-18 20:22:28,987 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 20:22:28,992 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 20:22:28,992 INFO L341 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-04-18 20:22:29,011 INFO L116 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-04-18 20:22:29,019 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 279 places, 285 transitions, 594 flow [2022-04-18 20:22:29,021 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 279 places, 285 transitions, 594 flow [2022-04-18 20:22:29,022 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 279 places, 285 transitions, 594 flow [2022-04-18 20:22:29,112 INFO L129 PetriNetUnfolder]: 16/282 cut-off events. [2022-04-18 20:22:29,112 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-04-18 20:22:29,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 282 events. 16/282 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 353 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 207. Up to 3 conditions per place. [2022-04-18 20:22:29,122 INFO L116 LiptonReduction]: Number of co-enabled transitions 6748 [2022-04-18 20:23:30,355 INFO L131 LiptonReduction]: Checked pairs total: 29769 [2022-04-18 20:23:30,356 INFO L133 LiptonReduction]: Total number of compositions: 303 [2022-04-18 20:23:30,361 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 83 transitions, 190 flow [2022-04-18 20:23:30,861 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14904 states, 14251 states have (on average 4.31317100554347) internal successors, (61467), 14903 states have internal predecessors, (61467), 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 20:23:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 14904 states, 14251 states have (on average 4.31317100554347) internal successors, (61467), 14903 states have internal predecessors, (61467), 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 20:23:30,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-04-18 20:23:30,893 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:30,893 INFO L499 BasicCegarLoop]: trace histogram [1] [2022-04-18 20:23:30,894 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:23:30,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:30,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1135, now seen corresponding path program 1 times [2022-04-18 20:23:30,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:30,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375326785] [2022-04-18 20:23:30,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:30,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:23:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 20:23:30,967 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:30,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375326785] [2022-04-18 20:23:30,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375326785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:23:30,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:23:30,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-04-18 20:23:30,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127655009] [2022-04-18 20:23:30,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:23:30,972 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-18 20:23:30,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:23:30,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-18 20:23:30,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 20:23:31,011 INFO L87 Difference]: Start difference. First operand has 14904 states, 14251 states have (on average 4.31317100554347) internal successors, (61467), 14903 states have internal predecessors, (61467), 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 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 20:23:31,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:23:31,254 INFO L93 Difference]: Finished difference Result 2335 states and 9159 transitions. [2022-04-18 20:23:31,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 20:23:31,256 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-04-18 20:23:31,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:23:31,289 INFO L225 Difference]: With dead ends: 2335 [2022-04-18 20:23:31,289 INFO L226 Difference]: Without dead ends: 2299 [2022-04-18 20:23:31,290 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 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 20:23:31,293 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:23:31,293 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-18 20:23:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2022-04-18 20:23:31,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2299. [2022-04-18 20:23:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2299 states, 2295 states have (on average 3.9459694989106753) internal successors, (9056), 2298 states have internal predecessors, (9056), 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 20:23:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 9056 transitions. [2022-04-18 20:23:31,516 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 9056 transitions. Word has length 1 [2022-04-18 20:23:31,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:23:31,516 INFO L478 AbstractCegarLoop]: Abstraction has 2299 states and 9056 transitions. [2022-04-18 20:23:31,517 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 20:23:31,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 9056 transitions. [2022-04-18 20:23:31,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-18 20:23:31,518 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:31,518 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:23:31,518 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 20:23:31,519 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:23:31,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:31,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1545751349, now seen corresponding path program 1 times [2022-04-18 20:23:31,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:31,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014622190] [2022-04-18 20:23:31,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:31,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:23:31,726 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 20:23:31,727 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:31,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014622190] [2022-04-18 20:23:31,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014622190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:23:31,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:23:31,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-18 20:23:31,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352658685] [2022-04-18 20:23:31,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:23:31,734 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 20:23:31,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:23:31,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 20:23:31,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-18 20:23:31,735 INFO L87 Difference]: Start difference. First operand 2299 states and 9056 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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 20:23:31,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:23:31,909 INFO L93 Difference]: Finished difference Result 3326 states and 12806 transitions. [2022-04-18 20:23:31,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-18 20:23:31,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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 12 [2022-04-18 20:23:31,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:23:31,928 INFO L225 Difference]: With dead ends: 3326 [2022-04-18 20:23:31,928 INFO L226 Difference]: Without dead ends: 3326 [2022-04-18 20:23:31,928 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-18 20:23:31,929 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 97 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:23:31,929 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 86 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-18 20:23:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2022-04-18 20:23:32,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 2939. [2022-04-18 20:23:32,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2939 states, 2935 states have (on average 3.955366269165247) internal successors, (11609), 2938 states have internal predecessors, (11609), 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 20:23:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 11609 transitions. [2022-04-18 20:23:32,040 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 11609 transitions. Word has length 12 [2022-04-18 20:23:32,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:23:32,040 INFO L478 AbstractCegarLoop]: Abstraction has 2939 states and 11609 transitions. [2022-04-18 20:23:32,041 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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 20:23:32,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 11609 transitions. [2022-04-18 20:23:32,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-18 20:23:32,058 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:32,058 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:23:32,058 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-18 20:23:32,059 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:23:32,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:32,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1045890965, now seen corresponding path program 1 times [2022-04-18 20:23:32,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:32,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194458300] [2022-04-18 20:23:32,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:32,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:23:32,246 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 20:23:32,247 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:32,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194458300] [2022-04-18 20:23:32,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194458300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:23:32,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:23:32,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:23:32,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467380201] [2022-04-18 20:23:32,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:23:32,248 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:23:32,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:23:32,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:23:32,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:23:32,249 INFO L87 Difference]: Start difference. First operand 2939 states and 11609 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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 20:23:32,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:23:32,707 INFO L93 Difference]: Finished difference Result 4314 states and 16984 transitions. [2022-04-18 20:23:32,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:23:32,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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 14 [2022-04-18 20:23:32,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:23:32,729 INFO L225 Difference]: With dead ends: 4314 [2022-04-18 20:23:32,729 INFO L226 Difference]: Without dead ends: 4314 [2022-04-18 20:23:32,730 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:23:32,730 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 68 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-18 20:23:32,731 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 73 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-18 20:23:32,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4314 states. [2022-04-18 20:23:32,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4314 to 3914. [2022-04-18 20:23:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3914 states, 3910 states have (on average 4.0163682864450125) internal successors, (15704), 3913 states have internal predecessors, (15704), 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 20:23:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3914 states to 3914 states and 15704 transitions. [2022-04-18 20:23:32,841 INFO L78 Accepts]: Start accepts. Automaton has 3914 states and 15704 transitions. Word has length 14 [2022-04-18 20:23:32,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:23:32,842 INFO L478 AbstractCegarLoop]: Abstraction has 3914 states and 15704 transitions. [2022-04-18 20:23:32,842 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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 20:23:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3914 states and 15704 transitions. [2022-04-18 20:23:32,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-18 20:23:32,844 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:32,844 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:23:32,844 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-18 20:23:32,844 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:23:32,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:32,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1300299212, now seen corresponding path program 1 times [2022-04-18 20:23:32,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:32,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31701592] [2022-04-18 20:23:32,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:32,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:23:32,921 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 20:23:32,921 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:32,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31701592] [2022-04-18 20:23:32,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31701592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:23:32,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:23:32,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:23:32,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283033924] [2022-04-18 20:23:32,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:23:32,922 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:23:32,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:23:32,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:23:32,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:23:32,923 INFO L87 Difference]: Start difference. First operand 3914 states and 15704 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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 20:23:33,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:23:33,260 INFO L93 Difference]: Finished difference Result 4867 states and 19600 transitions. [2022-04-18 20:23:33,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:23:33,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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 14 [2022-04-18 20:23:33,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:23:33,290 INFO L225 Difference]: With dead ends: 4867 [2022-04-18 20:23:33,290 INFO L226 Difference]: Without dead ends: 4867 [2022-04-18 20:23:33,290 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 20:23:33,291 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 64 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-18 20:23:33,291 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 56 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-18 20:23:33,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4867 states. [2022-04-18 20:23:33,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4867 to 4867. [2022-04-18 20:23:33,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4867 states, 4863 states have (on average 4.030433888546165) internal successors, (19600), 4866 states have internal predecessors, (19600), 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 20:23:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4867 states to 4867 states and 19600 transitions. [2022-04-18 20:23:33,420 INFO L78 Accepts]: Start accepts. Automaton has 4867 states and 19600 transitions. Word has length 14 [2022-04-18 20:23:33,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:23:33,421 INFO L478 AbstractCegarLoop]: Abstraction has 4867 states and 19600 transitions. [2022-04-18 20:23:33,421 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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 20:23:33,421 INFO L276 IsEmpty]: Start isEmpty. Operand 4867 states and 19600 transitions. [2022-04-18 20:23:33,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-18 20:23:33,423 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:33,423 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:23:33,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-18 20:23:33,424 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:23:33,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:33,424 INFO L85 PathProgramCache]: Analyzing trace with hash -354983230, now seen corresponding path program 1 times [2022-04-18 20:23:33,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:33,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323537269] [2022-04-18 20:23:33,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:33,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:23:33,473 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 20:23:33,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:33,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323537269] [2022-04-18 20:23:33,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323537269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:23:33,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:23:33,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-18 20:23:33,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549293489] [2022-04-18 20:23:33,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:23:33,474 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 20:23:33,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:23:33,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 20:23:33,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-18 20:23:33,475 INFO L87 Difference]: Start difference. First operand 4867 states and 19600 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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 20:23:33,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:23:33,632 INFO L93 Difference]: Finished difference Result 4746 states and 18607 transitions. [2022-04-18 20:23:33,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-18 20:23:33,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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 17 [2022-04-18 20:23:33,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:23:33,657 INFO L225 Difference]: With dead ends: 4746 [2022-04-18 20:23:33,657 INFO L226 Difference]: Without dead ends: 4746 [2022-04-18 20:23:33,657 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-18 20:23:33,658 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 79 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:23:33,658 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 101 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-18 20:23:33,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4746 states. [2022-04-18 20:23:33,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4746 to 4674. [2022-04-18 20:23:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4674 states, 4670 states have (on average 3.95203426124197) internal successors, (18456), 4673 states have internal predecessors, (18456), 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 20:23:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4674 states to 4674 states and 18456 transitions. [2022-04-18 20:23:33,838 INFO L78 Accepts]: Start accepts. Automaton has 4674 states and 18456 transitions. Word has length 17 [2022-04-18 20:23:33,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:23:33,838 INFO L478 AbstractCegarLoop]: Abstraction has 4674 states and 18456 transitions. [2022-04-18 20:23:33,838 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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 20:23:33,839 INFO L276 IsEmpty]: Start isEmpty. Operand 4674 states and 18456 transitions. [2022-04-18 20:23:33,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-18 20:23:33,842 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:33,842 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:23:33,842 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-18 20:23:33,842 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:23:33,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:33,842 INFO L85 PathProgramCache]: Analyzing trace with hash -475510862, now seen corresponding path program 1 times [2022-04-18 20:23:33,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:33,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454657345] [2022-04-18 20:23:33,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:33,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:23:33,976 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 20:23:33,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:33,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454657345] [2022-04-18 20:23:33,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454657345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:23:33,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:23:33,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-18 20:23:33,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332157606] [2022-04-18 20:23:33,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:23:33,977 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-18 20:23:33,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:23:33,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-18 20:23:33,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-18 20:23:33,978 INFO L87 Difference]: Start difference. First operand 4674 states and 18456 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 20:23:34,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:23:34,459 INFO L93 Difference]: Finished difference Result 13639 states and 54276 transitions. [2022-04-18 20:23:34,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-18 20:23:34,460 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 20:23:34,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:23:34,504 INFO L225 Difference]: With dead ends: 13639 [2022-04-18 20:23:34,505 INFO L226 Difference]: Without dead ends: 13639 [2022-04-18 20:23:34,506 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2022-04-18 20:23:34,509 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 264 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-18 20:23:34,509 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 99 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-18 20:23:34,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13639 states. [2022-04-18 20:23:34,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13639 to 6249. [2022-04-18 20:23:34,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6249 states, 6245 states have (on average 4.0819855884707765) internal successors, (25492), 6248 states have internal predecessors, (25492), 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 20:23:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6249 states to 6249 states and 25492 transitions. [2022-04-18 20:23:34,740 INFO L78 Accepts]: Start accepts. Automaton has 6249 states and 25492 transitions. Word has length 19 [2022-04-18 20:23:34,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:23:34,741 INFO L478 AbstractCegarLoop]: Abstraction has 6249 states and 25492 transitions. [2022-04-18 20:23:34,741 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 20:23:34,741 INFO L276 IsEmpty]: Start isEmpty. Operand 6249 states and 25492 transitions. [2022-04-18 20:23:34,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-18 20:23:34,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:34,747 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:23:34,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-18 20:23:34,747 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:23:34,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:34,748 INFO L85 PathProgramCache]: Analyzing trace with hash -248836359, now seen corresponding path program 1 times [2022-04-18 20:23:34,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:34,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189577928] [2022-04-18 20:23:34,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:34,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:23:34,930 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 20:23:34,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:34,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189577928] [2022-04-18 20:23:34,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189577928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:23:34,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:23:34,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:23:34,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745430386] [2022-04-18 20:23:34,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:23:34,931 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:23:34,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:23:34,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:23:34,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:23:34,931 INFO L87 Difference]: Start difference. First operand 6249 states and 25492 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 20:23:35,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:23:35,405 INFO L93 Difference]: Finished difference Result 5864 states and 23825 transitions. [2022-04-18 20:23:35,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-18 20:23:35,405 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 20:23:35,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:23:35,422 INFO L225 Difference]: With dead ends: 5864 [2022-04-18 20:23:35,423 INFO L226 Difference]: Without dead ends: 5864 [2022-04-18 20:23:35,423 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-04-18 20:23:35,423 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 156 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-18 20:23:35,424 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 84 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-18 20:23:35,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5864 states. [2022-04-18 20:23:35,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5864 to 4324. [2022-04-18 20:23:35,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4324 states, 4322 states have (on average 3.9696899583526144) internal successors, (17157), 4323 states have internal predecessors, (17157), 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 20:23:35,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4324 states to 4324 states and 17157 transitions. [2022-04-18 20:23:35,504 INFO L78 Accepts]: Start accepts. Automaton has 4324 states and 17157 transitions. Word has length 19 [2022-04-18 20:23:35,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:23:35,504 INFO L478 AbstractCegarLoop]: Abstraction has 4324 states and 17157 transitions. [2022-04-18 20:23:35,504 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 20:23:35,505 INFO L276 IsEmpty]: Start isEmpty. Operand 4324 states and 17157 transitions. [2022-04-18 20:23:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-18 20:23:35,509 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:35,509 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:23:35,509 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-18 20:23:35,509 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:23:35,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:35,509 INFO L85 PathProgramCache]: Analyzing trace with hash -23176092, now seen corresponding path program 2 times [2022-04-18 20:23:35,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:35,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853767434] [2022-04-18 20:23:35,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:35,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:23:35,706 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 20:23:35,706 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:35,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853767434] [2022-04-18 20:23:35,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853767434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:23:35,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:23:35,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-18 20:23:35,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202620252] [2022-04-18 20:23:35,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:23:35,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-18 20:23:35,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:23:35,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-18 20:23:35,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:23:35,707 INFO L87 Difference]: Start difference. First operand 4324 states and 17157 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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 20:23:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:23:36,758 INFO L93 Difference]: Finished difference Result 11583 states and 45995 transitions. [2022-04-18 20:23:36,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-18 20:23:36,758 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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 20:23:36,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:23:36,792 INFO L225 Difference]: With dead ends: 11583 [2022-04-18 20:23:36,792 INFO L226 Difference]: Without dead ends: 11583 [2022-04-18 20:23:36,793 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2022-04-18 20:23:36,794 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 320 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-18 20:23:36,794 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 121 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-18 20:23:36,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11583 states. [2022-04-18 20:23:36,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11583 to 4546. [2022-04-18 20:23:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4546 states, 4544 states have (on average 3.987455985915493) internal successors, (18119), 4545 states have internal predecessors, (18119), 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 20:23:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4546 states to 4546 states and 18119 transitions. [2022-04-18 20:23:36,940 INFO L78 Accepts]: Start accepts. Automaton has 4546 states and 18119 transitions. Word has length 19 [2022-04-18 20:23:36,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:23:36,940 INFO L478 AbstractCegarLoop]: Abstraction has 4546 states and 18119 transitions. [2022-04-18 20:23:36,941 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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 20:23:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 4546 states and 18119 transitions. [2022-04-18 20:23:36,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:23:36,947 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:36,947 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:23:36,947 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-18 20:23:36,947 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:23:36,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:36,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1473132013, now seen corresponding path program 1 times [2022-04-18 20:23:36,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:36,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493791565] [2022-04-18 20:23:36,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:36,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:23:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:23:37,068 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:37,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493791565] [2022-04-18 20:23:37,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493791565] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:23:37,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131921792] [2022-04-18 20:23:37,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:37,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:23:37,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:23:37,070 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 20:23:37,071 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 20:23:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:23:37,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-18 20:23:37,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:23:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:23:37,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:23:37,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:23:37,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131921792] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:23:37,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [669906962] [2022-04-18 20:23:37,429 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 20:23:37,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:23:37,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-04-18 20:23:37,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102192026] [2022-04-18 20:23:37,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:23:37,431 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-18 20:23:37,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:23:37,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-18 20:23:37,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-04-18 20:23:37,432 INFO L87 Difference]: Start difference. First operand 4546 states and 18119 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 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 20:23:37,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:23:37,866 INFO L93 Difference]: Finished difference Result 10004 states and 39482 transitions. [2022-04-18 20:23:37,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-18 20:23:37,866 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 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 22 [2022-04-18 20:23:37,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:23:37,895 INFO L225 Difference]: With dead ends: 10004 [2022-04-18 20:23:37,895 INFO L226 Difference]: Without dead ends: 10004 [2022-04-18 20:23:37,895 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2022-04-18 20:23:37,897 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 485 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-18 20:23:37,897 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 394 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-18 20:23:37,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10004 states. [2022-04-18 20:23:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10004 to 7979. [2022-04-18 20:23:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7979 states, 7977 states have (on average 4.071455434373825) internal successors, (32478), 7978 states have internal predecessors, (32478), 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 20:23:38,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7979 states to 7979 states and 32478 transitions. [2022-04-18 20:23:38,093 INFO L78 Accepts]: Start accepts. Automaton has 7979 states and 32478 transitions. Word has length 22 [2022-04-18 20:23:38,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:23:38,093 INFO L478 AbstractCegarLoop]: Abstraction has 7979 states and 32478 transitions. [2022-04-18 20:23:38,094 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 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 20:23:38,094 INFO L276 IsEmpty]: Start isEmpty. Operand 7979 states and 32478 transitions. [2022-04-18 20:23:38,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-18 20:23:38,104 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:38,104 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:23:38,124 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 20:23:38,317 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:23:38,317 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:23:38,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:38,317 INFO L85 PathProgramCache]: Analyzing trace with hash 17229305, now seen corresponding path program 1 times [2022-04-18 20:23:38,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:38,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476369468] [2022-04-18 20:23:38,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:38,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:23:38,387 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 20:23:38,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:38,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476369468] [2022-04-18 20:23:38,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476369468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:23:38,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:23:38,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:23:38,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839990350] [2022-04-18 20:23:38,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:23:38,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:23:38,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:23:38,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:23:38,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:23:38,389 INFO L87 Difference]: Start difference. First operand 7979 states and 32478 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 20:23:38,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:23:38,642 INFO L93 Difference]: Finished difference Result 8094 states and 32806 transitions. [2022-04-18 20:23:38,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:23:38,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 24 [2022-04-18 20:23:38,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:23:38,674 INFO L225 Difference]: With dead ends: 8094 [2022-04-18 20:23:38,675 INFO L226 Difference]: Without dead ends: 6121 [2022-04-18 20:23:38,675 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 20:23:38,676 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 36 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:23:38,676 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 52 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-18 20:23:38,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6121 states. [2022-04-18 20:23:38,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6121 to 6121. [2022-04-18 20:23:38,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6121 states, 6119 states have (on average 3.8704036607288774) internal successors, (23683), 6120 states have internal predecessors, (23683), 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 20:23:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 23683 transitions. [2022-04-18 20:23:38,808 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 23683 transitions. Word has length 24 [2022-04-18 20:23:38,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:23:38,808 INFO L478 AbstractCegarLoop]: Abstraction has 6121 states and 23683 transitions. [2022-04-18 20:23:38,808 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 20:23:38,809 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 23683 transitions. [2022-04-18 20:23:38,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-18 20:23:38,816 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:38,816 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:23:38,816 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-18 20:23:38,816 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:23:38,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:38,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1700778358, now seen corresponding path program 2 times [2022-04-18 20:23:38,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:38,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499780414] [2022-04-18 20:23:38,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:38,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:23:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:23:39,044 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:39,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499780414] [2022-04-18 20:23:39,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499780414] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:23:39,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801842567] [2022-04-18 20:23:39,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:23:39,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:23:39,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:23:39,046 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 20:23:39,070 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 20:23:39,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-18 20:23:39,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:23:39,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-18 20:23:39,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:23:39,365 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:23:39,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-04-18 20:23:39,449 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 20:23:39,449 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 11 treesize of output 11 [2022-04-18 20:23:39,569 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 15 treesize of output 11 [2022-04-18 20:23:39,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:39,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:39,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:39,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:39,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:39,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:39,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:39,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:39,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:39,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:39,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 68 [2022-04-18 20:23:39,662 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 18 treesize of output 20 [2022-04-18 20:23:39,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:39,696 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 28 treesize of output 27 [2022-04-18 20:23:39,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:39,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:39,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:39,741 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:23:39,741 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 1 case distinctions, treesize of input 40 treesize of output 42 [2022-04-18 20:23:39,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:39,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:39,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:39,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:39,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:39,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:39,788 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:23:39,788 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 3 case distinctions, treesize of input 52 treesize of output 57 [2022-04-18 20:23:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:23:39,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:23:39,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801842567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:23:39,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-18 20:23:39,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 22 [2022-04-18 20:23:39,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169869171] [2022-04-18 20:23:39,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:23:39,827 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-18 20:23:39,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:23:39,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-18 20:23:39,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2022-04-18 20:23:39,827 INFO L87 Difference]: Start difference. First operand 6121 states and 23683 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 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 20:23:40,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:23:40,923 INFO L93 Difference]: Finished difference Result 11223 states and 43578 transitions. [2022-04-18 20:23:40,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-18 20:23:40,923 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 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 24 [2022-04-18 20:23:40,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:23:40,954 INFO L225 Difference]: With dead ends: 11223 [2022-04-18 20:23:40,954 INFO L226 Difference]: Without dead ends: 11075 [2022-04-18 20:23:40,954 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=345, Invalid=987, Unknown=0, NotChecked=0, Total=1332 [2022-04-18 20:23:40,955 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 252 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-18 20:23:40,955 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 215 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-18 20:23:40,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11075 states. [2022-04-18 20:23:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11075 to 5899. [2022-04-18 20:23:41,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5899 states, 5897 states have (on average 3.8592504663388163) internal successors, (22758), 5898 states have internal predecessors, (22758), 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 20:23:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5899 states to 5899 states and 22758 transitions. [2022-04-18 20:23:41,076 INFO L78 Accepts]: Start accepts. Automaton has 5899 states and 22758 transitions. Word has length 24 [2022-04-18 20:23:41,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:23:41,076 INFO L478 AbstractCegarLoop]: Abstraction has 5899 states and 22758 transitions. [2022-04-18 20:23:41,077 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 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 20:23:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 5899 states and 22758 transitions. [2022-04-18 20:23:41,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-18 20:23:41,083 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:41,083 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:23:41,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-18 20:23:41,302 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-18 20:23:41,302 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:23:41,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:41,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1375834391, now seen corresponding path program 1 times [2022-04-18 20:23:41,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:41,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82898646] [2022-04-18 20:23:41,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:41,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:23:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:23:41,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:41,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82898646] [2022-04-18 20:23:41,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82898646] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:23:41,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435886431] [2022-04-18 20:23:41,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:41,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:23:41,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:23:41,423 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 20:23:41,433 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 20:23:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:23:41,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-18 20:23:41,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:23:41,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:23:41,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:23:41,789 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:23:41,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435886431] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:23:41,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1659627373] [2022-04-18 20:23:41,791 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 20:23:41,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:23:41,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-04-18 20:23:41,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495936728] [2022-04-18 20:23:41,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:23:41,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-18 20:23:41,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:23:41,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-18 20:23:41,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-04-18 20:23:41,793 INFO L87 Difference]: Start difference. First operand 5899 states and 22758 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 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 20:23:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:23:42,317 INFO L93 Difference]: Finished difference Result 6315 states and 23487 transitions. [2022-04-18 20:23:42,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-18 20:23:42,317 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 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 26 [2022-04-18 20:23:42,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:23:42,332 INFO L225 Difference]: With dead ends: 6315 [2022-04-18 20:23:42,332 INFO L226 Difference]: Without dead ends: 6315 [2022-04-18 20:23:42,333 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2022-04-18 20:23:42,333 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 386 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-18 20:23:42,333 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [386 Valid, 358 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-18 20:23:42,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6315 states. [2022-04-18 20:23:42,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6315 to 4779. [2022-04-18 20:23:42,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4779 states, 4777 states have (on average 3.837764287209546) internal successors, (18333), 4778 states have internal predecessors, (18333), 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 20:23:42,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4779 states to 4779 states and 18333 transitions. [2022-04-18 20:23:42,415 INFO L78 Accepts]: Start accepts. Automaton has 4779 states and 18333 transitions. Word has length 26 [2022-04-18 20:23:42,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:23:42,423 INFO L478 AbstractCegarLoop]: Abstraction has 4779 states and 18333 transitions. [2022-04-18 20:23:42,423 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 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 20:23:42,423 INFO L276 IsEmpty]: Start isEmpty. Operand 4779 states and 18333 transitions. [2022-04-18 20:23:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-18 20:23:42,433 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:42,433 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:23:42,450 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 20:23:42,649 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,SelfDestructingSolverStorable11 [2022-04-18 20:23:42,650 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:23:42,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:42,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1093124064, now seen corresponding path program 2 times [2022-04-18 20:23:42,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:42,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269266395] [2022-04-18 20:23:42,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:42,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:23:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:23:42,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:42,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269266395] [2022-04-18 20:23:42,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269266395] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:23:42,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475313827] [2022-04-18 20:23:42,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:23:42,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:23:42,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:23:42,899 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 20:23:42,900 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 20:23:43,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:23:43,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:23:43,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-18 20:23:43,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:23:43,061 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:23:43,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-04-18 20:23:43,106 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 20:23:43,106 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 11 treesize of output 11 [2022-04-18 20:23:43,193 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 15 treesize of output 11 [2022-04-18 20:23:43,226 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-18 20:23:43,227 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 28 treesize of output 27 [2022-04-18 20:23:43,275 INFO L356 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-04-18 20:23:43,275 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 40 treesize of output 42 [2022-04-18 20:23:43,339 INFO L356 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-04-18 20:23:43,340 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 52 treesize of output 57 [2022-04-18 20:23:43,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:43,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:43,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:43,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:43,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:43,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:43,562 INFO L356 Elim1Store]: treesize reduction 859, result has 5.3 percent of original size [2022-04-18 20:23:43,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 100 [2022-04-18 20:23:43,566 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 88 treesize of output 76 [2022-04-18 20:23:43,614 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-18 20:23:43,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:23:43,813 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1024 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1024) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1)) 0)) (forall ((v_ArrVal_1024 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1024) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 3)) 0)) (forall ((v_ArrVal_1024 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1024) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_1024 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1024) c_~A~0.base) (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4))) 0))) is different from false [2022-04-18 20:23:43,858 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1024 (Array Int Int))) (= (let ((.cse0 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 3))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse0 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1024) c_~A~0.base) .cse0)) 0)) (forall ((v_ArrVal_1024 (Array Int Int))) (= (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse1 3) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1024) c_~A~0.base) (+ c_~A~0.offset 2 .cse1))) 0)) (forall ((v_ArrVal_1024 (Array Int Int))) (= (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2 3) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1024) c_~A~0.base) (+ c_~A~0.offset .cse2))) 0)) (forall ((v_ArrVal_1024 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3 3) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1024) c_~A~0.base) (+ c_~A~0.offset .cse3 1))) 0))) is different from false [2022-04-18 20:23:43,876 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1024 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset .cse0 3))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse0) 0) .cse1 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1024) c_~A~0.base) .cse1))) 0)) (forall ((v_ArrVal_1024 (Array Int Int))) (= (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset .cse2 3) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1024) c_~A~0.base) (+ c_~A~0.offset .cse2 1))) 0)) (forall ((v_ArrVal_1024 (Array Int Int))) (= (let ((.cse4 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (+ c_~A~0.offset 2 .cse4))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse3 0) (+ c_~A~0.offset .cse4 3) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1024) c_~A~0.base) .cse3))) 0)) (forall ((v_ArrVal_1024 (Array Int Int))) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset .cse5 3) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1024) c_~A~0.base) (+ c_~A~0.offset .cse5))) 0))) is different from false [2022-04-18 20:23:43,895 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1024 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset .cse0 3))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0 1) 0) (+ c_~A~0.offset 2 .cse0) 0) .cse1 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1024) c_~A~0.base) .cse1))) 0)) (forall ((v_ArrVal_1024 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset .cse3 1))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse2 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset .cse3 3) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1024) c_~A~0.base) .cse2))) 0)) (forall ((v_ArrVal_1024 (Array Int Int))) (= (let ((.cse4 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset 2 .cse4) 0) (+ c_~A~0.offset .cse4 3) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1024) c_~A~0.base) (+ c_~A~0.offset .cse4))) 0)) (forall ((v_ArrVal_1024 (Array Int Int))) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse6 (+ c_~A~0.offset 2 .cse5))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse5 1) 0) .cse6 0) (+ c_~A~0.offset .cse5 3) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1024) c_~A~0.base) .cse6))) 0))) is different from false [2022-04-18 20:23:44,077 INFO L356 Elim1Store]: treesize reduction 1491, result has 5.7 percent of original size [2022-04-18 20:23:44,077 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 8 case distinctions, treesize of input 69 treesize of output 105 [2022-04-18 20:23:44,085 INFO L356 Elim1Store]: treesize reduction 399, result has 0.3 percent of original size [2022-04-18 20:23:44,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 121 treesize of output 55 [2022-04-18 20:23:44,088 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 10 treesize of output 3 [2022-04-18 20:23:44,142 INFO L356 Elim1Store]: treesize reduction 1580, result has 0.1 percent of original size [2022-04-18 20:23:44,143 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 8 case distinctions, treesize of input 69 treesize of output 1 [2022-04-18 20:23:44,204 INFO L356 Elim1Store]: treesize reduction 1580, result has 0.1 percent of original size [2022-04-18 20:23:44,204 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 8 case distinctions, treesize of input 69 treesize of output 1 [2022-04-18 20:23:44,264 INFO L356 Elim1Store]: treesize reduction 1580, result has 0.1 percent of original size [2022-04-18 20:23:44,264 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 8 case distinctions, treesize of input 68 treesize of output 1 [2022-04-18 20:23:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 3 not checked. [2022-04-18 20:23:44,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475313827] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:23:44,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1283319621] [2022-04-18 20:23:44,349 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 20:23:44,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:23:44,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 28 [2022-04-18 20:23:44,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676077982] [2022-04-18 20:23:44,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:23:44,350 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-18 20:23:44,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:23:44,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-18 20:23:44,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=547, Unknown=8, NotChecked=204, Total=870 [2022-04-18 20:23:44,350 INFO L87 Difference]: Start difference. First operand 4779 states and 18333 transitions. Second operand has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 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 20:23:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:23:48,471 INFO L93 Difference]: Finished difference Result 15712 states and 59603 transitions. [2022-04-18 20:23:48,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-18 20:23:48,471 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 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 28 [2022-04-18 20:23:48,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:23:48,508 INFO L225 Difference]: With dead ends: 15712 [2022-04-18 20:23:48,509 INFO L226 Difference]: Without dead ends: 15342 [2022-04-18 20:23:48,509 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 48 SyntacticMatches, 11 SemanticMatches, 53 ConstructedPredicates, 4 IntricatePredicates, 8 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=502, Invalid=2056, Unknown=8, NotChecked=404, Total=2970 [2022-04-18 20:23:48,510 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 685 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 2660 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 5236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 2660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2437 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-18 20:23:48,510 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [685 Valid, 816 Invalid, 5236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 2660 Invalid, 0 Unknown, 2437 Unchecked, 2.7s Time] [2022-04-18 20:23:48,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15342 states. [2022-04-18 20:23:48,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15342 to 6124. [2022-04-18 20:23:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6124 states, 6122 states have (on average 3.9116301862136558) internal successors, (23947), 6123 states have internal predecessors, (23947), 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 20:23:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6124 states to 6124 states and 23947 transitions. [2022-04-18 20:23:48,655 INFO L78 Accepts]: Start accepts. Automaton has 6124 states and 23947 transitions. Word has length 28 [2022-04-18 20:23:48,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:23:48,655 INFO L478 AbstractCegarLoop]: Abstraction has 6124 states and 23947 transitions. [2022-04-18 20:23:48,655 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 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 20:23:48,655 INFO L276 IsEmpty]: Start isEmpty. Operand 6124 states and 23947 transitions. [2022-04-18 20:23:48,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-18 20:23:48,663 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:48,663 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:23:48,688 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 20:23:48,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:23:48,867 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:23:48,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:48,868 INFO L85 PathProgramCache]: Analyzing trace with hash -869128370, now seen corresponding path program 3 times [2022-04-18 20:23:48,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:48,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201848187] [2022-04-18 20:23:48,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:48,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:23:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:23:49,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:49,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201848187] [2022-04-18 20:23:49,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201848187] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:23:49,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274655330] [2022-04-18 20:23:49,148 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:23:49,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:23:49,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:23:49,149 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 20:23:49,149 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 20:23:58,104 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:23:58,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:23:58,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-18 20:23:58,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:23:58,203 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:23:58,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-04-18 20:23:58,251 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 20:23:58,251 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 11 treesize of output 11 [2022-04-18 20:23:58,417 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 15 treesize of output 11 [2022-04-18 20:23:58,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,447 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 28 treesize of output 27 [2022-04-18 20:23:58,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,497 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 40 treesize of output 42 [2022-04-18 20:23:58,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:58,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 98 [2022-04-18 20:23:58,653 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 89 treesize of output 79 [2022-04-18 20:24:04,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:04,770 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:24:04,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 99 treesize of output 116 [2022-04-18 20:24:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-18 20:24:06,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:24:06,867 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1209 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse0 c_~A~0.offset) 0) (+ .cse0 c_~A~0.offset 1) 0) (+ .cse0 c_~A~0.offset 2) 0) (+ .cse0 c_~A~0.offset 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_1209 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse1 c_~A~0.offset) 0) (+ .cse1 c_~A~0.offset 1) 0) (+ .cse1 c_~A~0.offset 2) 0) (+ .cse1 c_~A~0.offset 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_1209 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse2 c_~A~0.offset) 0) (+ .cse2 c_~A~0.offset 1) 0) (+ .cse2 c_~A~0.offset 2) 0) (+ .cse2 c_~A~0.offset 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1)) 0))) is different from false [2022-04-18 20:24:06,918 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_thread2Thread1of1ForFork0_~i~1_482 Int)) (or (and (forall ((v_ArrVal_1209 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0) 0) (+ c_~A~0.offset .cse0 1) 0) (+ c_~A~0.offset .cse0 2) 0) (+ c_~A~0.offset .cse0 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_1209 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1)) 0)) (forall ((v_ArrVal_1209 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0))) (not (<= v_thread2Thread1of1ForFork0_~i~1_482 0)))) is different from false [2022-04-18 20:24:09,027 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_thread2Thread1of1ForFork0_~i~1_482 Int)) (or (and (forall ((v_ArrVal_1209 (Array Int Int))) (= (let ((.cse0 (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4)))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse0 0) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) .cse0)) 0)) (forall ((v_ArrVal_1209 (Array Int Int))) (= (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset .cse2 1))) 0)) (forall ((v_ArrVal_1209 (Array Int Int))) (= (let ((.cse4 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse4) 0) (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset .cse4))) 0))) (not (<= v_thread2Thread1of1ForFork0_~i~1_482 0)))) is different from false [2022-04-18 20:24:09,096 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_thread2Thread1of1ForFork0_~i~1_482 Int)) (or (and (forall ((v_ArrVal_1209 (Array Int Int))) (= (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (+ c_~A~0.offset .cse1 1))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse0 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) .cse0))) 0)) (forall ((v_ArrVal_1209 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (+ c_~A~0.offset 2 .cse3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3 1) 0) .cse4 0) (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) .cse4))) 0)) (forall ((v_ArrVal_1209 (Array Int Int))) (= (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset 2 .cse6) 0) (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset .cse6))) 0))) (not (<= v_thread2Thread1of1ForFork0_~i~1_482 0)))) is different from false [2022-04-18 20:24:09,266 INFO L356 Elim1Store]: treesize reduction 1303, result has 6.5 percent of original size [2022-04-18 20:24:09,267 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 73 treesize of output 104 [2022-04-18 20:24:09,275 INFO L356 Elim1Store]: treesize reduction 366, result has 0.3 percent of original size [2022-04-18 20:24:09,275 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 119 treesize of output 50 [2022-04-18 20:24:09,279 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 9 treesize of output 3 [2022-04-18 20:24:09,322 INFO L356 Elim1Store]: treesize reduction 1392, result has 0.1 percent of original size [2022-04-18 20:24:09,323 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 74 treesize of output 1 [2022-04-18 20:24:09,368 INFO L356 Elim1Store]: treesize reduction 1392, result has 0.1 percent of original size [2022-04-18 20:24:09,368 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 74 treesize of output 1 [2022-04-18 20:24:09,404 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2022-04-18 20:24:09,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274655330] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:24:09,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1360295115] [2022-04-18 20:24:09,405 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 20:24:09,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:24:09,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 27 [2022-04-18 20:24:09,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587745] [2022-04-18 20:24:09,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:24:09,406 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-18 20:24:09,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:24:09,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-18 20:24:09,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=491, Unknown=6, NotChecked=196, Total=812 [2022-04-18 20:24:09,407 INFO L87 Difference]: Start difference. First operand 6124 states and 23947 transitions. Second operand has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 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 20:24:21,402 WARN L232 SmtUtils]: Spent 11.74s on a formula simplification. DAG size of input: 49 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-18 20:24:22,253 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_thread2Thread1of1ForFork0_~i~1_482 Int)) (or (and (forall ((v_ArrVal_1209 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0) 0) (+ c_~A~0.offset .cse0 1) 0) (+ c_~A~0.offset .cse0 2) 0) (+ c_~A~0.offset .cse0 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_1209 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1)) 0)) (forall ((v_ArrVal_1209 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0))) (not (<= v_thread2Thread1of1ForFork0_~i~1_482 0)))) (not (= c_~C~0.base c_~A~0.base)) (= c_thread1Thread1of1ForFork2_~i~0 0) (= c_~A~0.offset 0)) is different from false [2022-04-18 20:24:23,466 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (= (select .cse0 (+ c_~A~0.offset 2 .cse1)) 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_482 Int)) (or (and (forall ((v_ArrVal_1209 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_1209 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1)) 0)) (forall ((v_ArrVal_1209 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0))) (not (<= v_thread2Thread1of1ForFork0_~i~1_482 0)))) (= (select .cse0 (+ c_~A~0.offset .cse1)) 0) (= (+ (- 1) c_thread1Thread1of1ForFork2_~i~0) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 (+ c_~A~0.offset .cse1 1)) 0) (= c_~A~0.offset 0))) is different from false [2022-04-18 20:24:25,467 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_thread2Thread1of1ForFork0_~i~1_482 Int)) (or (and (forall ((v_ArrVal_1209 (Array Int Int))) (= (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (+ c_~A~0.offset .cse1 1))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse0 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) .cse0))) 0)) (forall ((v_ArrVal_1209 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (+ c_~A~0.offset 2 .cse3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3 1) 0) .cse4 0) (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) .cse4))) 0)) (forall ((v_ArrVal_1209 (Array Int Int))) (= (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset 2 .cse6) 0) (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset .cse6))) 0))) (not (<= v_thread2Thread1of1ForFork0_~i~1_482 0)))) (not (= c_~C~0.base c_~A~0.base))) is different from false [2022-04-18 20:24:30,499 WARN L833 $PredicateComparison]: unable to prove that (and (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork0_~i~1_482 Int)) (or (and (forall ((v_ArrVal_1209 (Array Int Int))) (= (let ((.cse0 (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4)))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse0 0) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) .cse0)) 0)) (forall ((v_ArrVal_1209 (Array Int Int))) (= (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset .cse2 1))) 0)) (forall ((v_ArrVal_1209 (Array Int Int))) (= (let ((.cse4 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse4) 0) (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset .cse4))) 0))) (not (<= v_thread2Thread1of1ForFork0_~i~1_482 0))))) is different from false [2022-04-18 20:24:33,654 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_thread2Thread1of1ForFork0_~i~1_482 Int)) (or (and (forall ((v_ArrVal_1209 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0) 0) (+ c_~A~0.offset .cse0 1) 0) (+ c_~A~0.offset .cse0 2) 0) (+ c_~A~0.offset .cse0 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_1209 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1)) 0)) (forall ((v_ArrVal_1209 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_482 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0))) c_~C~0.base v_ArrVal_1209) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0))) (not (<= v_thread2Thread1of1ForFork0_~i~1_482 0)))) (not (= c_~C~0.base c_~A~0.base))) is different from false [2022-04-18 20:24:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:24:40,073 INFO L93 Difference]: Finished difference Result 14888 states and 57125 transitions. [2022-04-18 20:24:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-18 20:24:40,073 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 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 28 [2022-04-18 20:24:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:24:40,110 INFO L225 Difference]: With dead ends: 14888 [2022-04-18 20:24:40,111 INFO L226 Difference]: Without dead ends: 14777 [2022-04-18 20:24:40,111 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 39.2s TimeCoverageRelationStatistics Valid=237, Invalid=974, Unknown=15, NotChecked=666, Total=1892 [2022-04-18 20:24:40,114 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 487 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 4202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2587 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-18 20:24:40,117 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [487 Valid, 612 Invalid, 4202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1549 Invalid, 0 Unknown, 2587 Unchecked, 1.8s Time] [2022-04-18 20:24:40,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14777 states. [2022-04-18 20:24:40,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14777 to 6678. [2022-04-18 20:24:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6678 states, 6676 states have (on average 3.9301977231875376) internal successors, (26238), 6677 states have internal predecessors, (26238), 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 20:24:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6678 states to 6678 states and 26238 transitions. [2022-04-18 20:24:40,368 INFO L78 Accepts]: Start accepts. Automaton has 6678 states and 26238 transitions. Word has length 28 [2022-04-18 20:24:40,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:24:40,368 INFO L478 AbstractCegarLoop]: Abstraction has 6678 states and 26238 transitions. [2022-04-18 20:24:40,368 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 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 20:24:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 6678 states and 26238 transitions. [2022-04-18 20:24:40,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-18 20:24:40,376 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:24:40,376 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:24:40,399 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 20:24:40,583 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:24:40,584 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:24:40,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:24:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash -881354150, now seen corresponding path program 4 times [2022-04-18 20:24:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:24:40,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575951703] [2022-04-18 20:24:40,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:24:40,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:24:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:24:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:24:40,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:24:40,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575951703] [2022-04-18 20:24:40,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575951703] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:24:40,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884153064] [2022-04-18 20:24:40,873 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-18 20:24:40,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:24:40,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:24:40,874 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 20:24:40,875 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 20:24:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:24:41,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-18 20:24:41,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:24:41,051 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:24:41,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-04-18 20:24:41,082 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 20:24:41,082 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 11 treesize of output 11 [2022-04-18 20:24:41,145 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 15 treesize of output 11 [2022-04-18 20:24:41,161 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-18 20:24:41,161 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 28 treesize of output 27 [2022-04-18 20:24:41,186 INFO L356 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-04-18 20:24:41,187 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 40 treesize of output 42 [2022-04-18 20:24:41,242 INFO L356 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-04-18 20:24:41,242 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 52 treesize of output 57 [2022-04-18 20:24:41,444 INFO L356 Elim1Store]: treesize reduction 1318, result has 5.9 percent of original size [2022-04-18 20:24:41,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 5 new quantified variables, introduced 13 case distinctions, treesize of input 90 treesize of output 113 [2022-04-18 20:24:41,449 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 101 treesize of output 89 [2022-04-18 20:24:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:24:47,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:24:47,714 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_thread2Thread1of1ForFork0_~i~1_484 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_484 0)) (and (forall ((v_ArrVal_1395 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0) 0) (+ c_~A~0.offset .cse0 1) 0) (+ c_~A~0.offset 2 .cse0) 0) (+ c_~A~0.offset 3 .cse0) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 3)) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset 3 .cse2) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset 3 .cse3) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1))))))) is different from false [2022-04-18 20:24:47,775 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_thread2Thread1of1ForFork0_~i~1_484 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_484 0)) (and (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0 3) 0) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset .cse0 1))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2 3) 0) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset 3 .cse3) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset .cse2))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse4 0) (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse4)) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse6 3) 0) (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset 2 .cse7) 0) (+ c_~A~0.offset 3 .cse7) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset 2 .cse6))) 0))))) is different from false [2022-04-18 20:24:47,919 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_thread2Thread1of1ForFork0_~i~1_484 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_484 0)) (and (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset .cse0 3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse0) 0) .cse1 0) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset 3 .cse2) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse1))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset 2 .cse4) 0) (+ c_~A~0.offset 3 .cse4) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset .cse3))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (+ c_~A~0.offset 2 .cse6))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse5 0) (+ c_~A~0.offset .cse6 3) 0) (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset 2 .cse7) 0) (+ c_~A~0.offset 3 .cse7) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse5))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse8 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse9 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse8) 0) (+ c_~A~0.offset .cse8 3) 0) (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset .cse9 1) 0) (+ c_~A~0.offset 2 .cse9) 0) (+ c_~A~0.offset 3 .cse9) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset .cse8 1))) 0))))) is different from false [2022-04-18 20:24:47,977 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_thread2Thread1of1ForFork0_~i~1_484 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_484 0)) (and (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset .cse0 3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0 1) 0) (+ c_~A~0.offset 2 .cse0) 0) .cse1 0) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset 3 .cse2) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse1))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (+ c_~A~0.offset 2 .cse3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3 1) 0) .cse4 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse4))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse7 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse6 (+ c_~A~0.offset .cse7 1))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse6 0) (+ c_~A~0.offset 2 .cse7) 0) (+ c_~A~0.offset .cse7 3) 0) (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset 2 .cse8) 0) (+ c_~A~0.offset 3 .cse8) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse6))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse9 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse10 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse9 1) 0) (+ c_~A~0.offset 2 .cse9) 0) (+ c_~A~0.offset .cse9 3) 0) (+ c_~A~0.offset .cse10) 0) (+ c_~A~0.offset .cse10 1) 0) (+ c_~A~0.offset 2 .cse10) 0) (+ c_~A~0.offset 3 .cse10) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset .cse9))) 0))))) is different from false [2022-04-18 20:24:48,157 INFO L356 Elim1Store]: treesize reduction 1871, result has 5.2 percent of original size [2022-04-18 20:24:48,157 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 8 case distinctions, treesize of input 82 treesize of output 118 [2022-04-18 20:24:48,164 INFO L356 Elim1Store]: treesize reduction 490, result has 0.2 percent of original size [2022-04-18 20:24:48,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 55 [2022-04-18 20:24:48,167 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 10 treesize of output 3 [2022-04-18 20:24:48,226 INFO L356 Elim1Store]: treesize reduction 1973, result has 0.1 percent of original size [2022-04-18 20:24:48,226 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 8 case distinctions, treesize of input 82 treesize of output 1 [2022-04-18 20:24:48,304 INFO L356 Elim1Store]: treesize reduction 1973, result has 0.1 percent of original size [2022-04-18 20:24:48,304 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 8 case distinctions, treesize of input 82 treesize of output 1 [2022-04-18 20:24:48,381 INFO L356 Elim1Store]: treesize reduction 1973, result has 0.1 percent of original size [2022-04-18 20:24:48,382 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 8 case distinctions, treesize of input 81 treesize of output 1 [2022-04-18 20:24:48,422 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 3 not checked. [2022-04-18 20:24:48,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884153064] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:24:48,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [605375982] [2022-04-18 20:24:48,423 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 20:24:48,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:24:48,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 20 [2022-04-18 20:24:48,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635666707] [2022-04-18 20:24:48,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:24:48,424 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-18 20:24:48,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:24:48,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-18 20:24:48,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=230, Unknown=10, NotChecked=140, Total=462 [2022-04-18 20:24:48,424 INFO L87 Difference]: Start difference. First operand 6678 states and 26238 transitions. Second operand has 22 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 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 20:24:51,339 WARN L833 $PredicateComparison]: unable to prove that (and (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork0_~i~1_484 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_484 0)) (and (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset .cse0 3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse0) 0) .cse1 0) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset 3 .cse2) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse1))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset 2 .cse4) 0) (+ c_~A~0.offset 3 .cse4) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset .cse3))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (+ c_~A~0.offset 2 .cse6))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse5 0) (+ c_~A~0.offset .cse6 3) 0) (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset 2 .cse7) 0) (+ c_~A~0.offset 3 .cse7) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse5))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse8 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse9 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse8) 0) (+ c_~A~0.offset .cse8 3) 0) (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset .cse9 1) 0) (+ c_~A~0.offset 2 .cse9) 0) (+ c_~A~0.offset 3 .cse9) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset .cse8 1))) 0))))) (= c_thread1Thread1of1ForFork2_~i~0 0)) is different from false [2022-04-18 20:24:52,168 WARN L833 $PredicateComparison]: unable to prove that (and (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork0_~i~1_484 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_484 0)) (and (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0 3) 0) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset .cse0 1))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2 3) 0) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset 3 .cse3) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset .cse2))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse4 0) (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse4)) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse6 3) 0) (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset 2 .cse7) 0) (+ c_~A~0.offset 3 .cse7) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset 2 .cse6))) 0))))) (= c_thread1Thread1of1ForFork2_~i~0 0)) is different from false [2022-04-18 20:24:52,985 WARN L833 $PredicateComparison]: unable to prove that (and (not (= c_~C~0.base c_~A~0.base)) (= c_thread1Thread1of1ForFork2_~i~0 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_484 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_484 0)) (and (forall ((v_ArrVal_1395 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0) 0) (+ c_~A~0.offset .cse0 1) 0) (+ c_~A~0.offset 2 .cse0) 0) (+ c_~A~0.offset 3 .cse0) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 3)) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset 3 .cse2) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset 3 .cse3) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1)))))))) is different from false [2022-04-18 20:24:54,263 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#race| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork0_~i~1_484 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_484 0)) (and (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset .cse0 3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0 1) 0) (+ c_~A~0.offset 2 .cse0) 0) .cse1 0) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset 3 .cse2) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse1))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (+ c_~A~0.offset 2 .cse3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3 1) 0) .cse4 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse4))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse7 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse6 (+ c_~A~0.offset .cse7 1))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse6 0) (+ c_~A~0.offset 2 .cse7) 0) (+ c_~A~0.offset .cse7 3) 0) (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset 2 .cse8) 0) (+ c_~A~0.offset 3 .cse8) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse6))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse9 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse10 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse9 1) 0) (+ c_~A~0.offset 2 .cse9) 0) (+ c_~A~0.offset .cse9 3) 0) (+ c_~A~0.offset .cse10) 0) (+ c_~A~0.offset .cse10 1) 0) (+ c_~A~0.offset 2 .cse10) 0) (+ c_~A~0.offset 3 .cse10) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset .cse9))) 0))))) (<= 1 c_thread1Thread1of1ForFork2_~i~0)) is different from false [2022-04-18 20:24:55,181 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (= (select .cse0 (+ c_~A~0.offset .cse1)) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork0_~i~1_484 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_484 0)) (and (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (+ c_~A~0.offset .cse2 3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse2) 0) .cse3 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset 2 .cse4) 0) (+ c_~A~0.offset 3 .cse4) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse3))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset .cse5 3) 0) (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset 2 .cse6) 0) (+ c_~A~0.offset 3 .cse6) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset .cse5))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse8 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse7 (+ c_~A~0.offset 2 .cse8))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse9 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse7 0) (+ c_~A~0.offset .cse8 3) 0) (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset .cse9 1) 0) (+ c_~A~0.offset 2 .cse9) 0) (+ c_~A~0.offset 3 .cse9) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse7))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse11 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse10) 0) (+ c_~A~0.offset .cse10 3) 0) (+ c_~A~0.offset .cse11) 0) (+ c_~A~0.offset .cse11 1) 0) (+ c_~A~0.offset 2 .cse11) 0) (+ c_~A~0.offset 3 .cse11) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset .cse10 1))) 0))))) (= (select .cse0 (+ c_~A~0.offset .cse1 1)) 0) (<= 1 c_thread1Thread1of1ForFork2_~i~0))) is different from false [2022-04-18 20:24:56,060 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (= (select .cse0 (+ c_~A~0.offset 2 .cse1)) 0) (= (select .cse0 (+ c_~A~0.offset .cse1)) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork0_~i~1_484 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_484 0)) (and (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2 3) 0) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset 3 .cse3) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset .cse2 1))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse4 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse4 3) 0) (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset .cse4))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse6 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse6 0) (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset 2 .cse7) 0) (+ c_~A~0.offset 3 .cse7) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse6)) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse8 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse9 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse8 3) 0) (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset .cse9 1) 0) (+ c_~A~0.offset 2 .cse9) 0) (+ c_~A~0.offset 3 .cse9) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset 2 .cse8))) 0))))) (= (select .cse0 (+ c_~A~0.offset .cse1 1)) 0) (<= 1 c_thread1Thread1of1ForFork2_~i~0))) is different from false [2022-04-18 20:24:56,939 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (= (select .cse0 (+ c_~A~0.offset .cse1 3)) 0) (= (select .cse0 (+ c_~A~0.offset 2 .cse1)) 0) (= (select .cse0 (+ c_~A~0.offset .cse1)) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 (+ c_~A~0.offset .cse1 1)) 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_484 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_484 0)) (and (forall ((v_ArrVal_1395 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset 3 .cse2) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 3)) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset 3 .cse3) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset 2 .cse4) 0) (+ c_~A~0.offset 3 .cse4) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1))))))) (<= 1 c_thread1Thread1of1ForFork2_~i~0))) is different from false [2022-04-18 20:24:58,023 WARN L833 $PredicateComparison]: unable to prove that (and (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork0_~i~1_484 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_484 0)) (and (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset .cse0 3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0 1) 0) (+ c_~A~0.offset 2 .cse0) 0) .cse1 0) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset 3 .cse2) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse1))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (+ c_~A~0.offset 2 .cse3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3 1) 0) .cse4 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse4))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse7 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse6 (+ c_~A~0.offset .cse7 1))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse6 0) (+ c_~A~0.offset 2 .cse7) 0) (+ c_~A~0.offset .cse7 3) 0) (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset 2 .cse8) 0) (+ c_~A~0.offset 3 .cse8) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse6))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse9 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse10 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse9 1) 0) (+ c_~A~0.offset 2 .cse9) 0) (+ c_~A~0.offset .cse9 3) 0) (+ c_~A~0.offset .cse10) 0) (+ c_~A~0.offset .cse10 1) 0) (+ c_~A~0.offset 2 .cse10) 0) (+ c_~A~0.offset 3 .cse10) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset .cse9))) 0)))))) is different from false [2022-04-18 20:24:59,136 WARN L833 $PredicateComparison]: unable to prove that (and (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork0_~i~1_484 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_484 0)) (and (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset .cse0 3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse0) 0) .cse1 0) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset 3 .cse2) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse1))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset 2 .cse4) 0) (+ c_~A~0.offset 3 .cse4) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset .cse3))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (+ c_~A~0.offset 2 .cse6))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse5 0) (+ c_~A~0.offset .cse6 3) 0) (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset 2 .cse7) 0) (+ c_~A~0.offset 3 .cse7) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse5))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse8 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse9 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse8) 0) (+ c_~A~0.offset .cse8 3) 0) (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset .cse9 1) 0) (+ c_~A~0.offset 2 .cse9) 0) (+ c_~A~0.offset 3 .cse9) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset .cse8 1))) 0)))))) is different from false [2022-04-18 20:25:00,250 WARN L833 $PredicateComparison]: unable to prove that (and (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork0_~i~1_484 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_484 0)) (and (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0 3) 0) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset .cse0 1))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2 3) 0) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset 3 .cse3) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset .cse2))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse4 0) (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) .cse4)) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse6 3) 0) (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset 2 .cse7) 0) (+ c_~A~0.offset 3 .cse7) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset 2 .cse6))) 0)))))) is different from false [2022-04-18 20:25:01,149 WARN L833 $PredicateComparison]: unable to prove that (and (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork0_~i~1_484 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_484 0)) (and (forall ((v_ArrVal_1395 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0) 0) (+ c_~A~0.offset .cse0 1) 0) (+ c_~A~0.offset 2 .cse0) 0) (+ c_~A~0.offset 3 .cse0) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 3)) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset 3 .cse2) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_1395 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_484 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset 3 .cse3) 0))) c_~C~0.base v_ArrVal_1395) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1)))))))) is different from false [2022-04-18 20:25:03,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:25:03,316 INFO L93 Difference]: Finished difference Result 13949 states and 53312 transitions. [2022-04-18 20:25:03,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-18 20:25:03,316 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 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 28 [2022-04-18 20:25:03,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:25:03,349 INFO L225 Difference]: With dead ends: 13949 [2022-04-18 20:25:03,350 INFO L226 Difference]: Without dead ends: 13912 [2022-04-18 20:25:03,350 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=149, Invalid=396, Unknown=21, NotChecked=840, Total=1406 [2022-04-18 20:25:03,350 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 327 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 2387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1692 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-18 20:25:03,351 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 407 Invalid, 2387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 688 Invalid, 0 Unknown, 1692 Unchecked, 0.7s Time] [2022-04-18 20:25:03,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13912 states. [2022-04-18 20:25:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13912 to 6681. [2022-04-18 20:25:03,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6681 states, 6679 states have (on average 3.929630184159305) internal successors, (26246), 6680 states have internal predecessors, (26246), 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 20:25:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6681 states to 6681 states and 26246 transitions. [2022-04-18 20:25:03,499 INFO L78 Accepts]: Start accepts. Automaton has 6681 states and 26246 transitions. Word has length 28 [2022-04-18 20:25:03,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:25:03,499 INFO L478 AbstractCegarLoop]: Abstraction has 6681 states and 26246 transitions. [2022-04-18 20:25:03,499 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 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 20:25:03,500 INFO L276 IsEmpty]: Start isEmpty. Operand 6681 states and 26246 transitions. [2022-04-18 20:25:03,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-18 20:25:03,506 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:25:03,507 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:25:03,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-18 20:25:03,720 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:25:03,720 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:25:03,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:25:03,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1917509126, now seen corresponding path program 5 times [2022-04-18 20:25:03,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:25:03,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922989925] [2022-04-18 20:25:03,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:25:03,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:25:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:25:03,945 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:25:03,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:25:03,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922989925] [2022-04-18 20:25:03,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922989925] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:25:03,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601169135] [2022-04-18 20:25:03,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:25:03,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:25:03,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:25:03,946 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 20:25:03,947 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 20:25:04,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:25:04,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:25:04,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-18 20:25:04,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:25:04,121 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:25:04,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-04-18 20:25:04,161 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 20:25:04,162 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 11 treesize of output 11 [2022-04-18 20:25:04,250 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 15 treesize of output 11 [2022-04-18 20:25:04,285 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-18 20:25:04,286 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 28 treesize of output 27 [2022-04-18 20:25:04,333 INFO L356 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-04-18 20:25:04,333 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 40 treesize of output 42 [2022-04-18 20:25:04,412 INFO L356 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-04-18 20:25:04,413 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 52 treesize of output 57 [2022-04-18 20:25:04,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:04,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:04,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:04,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:04,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:04,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:04,646 INFO L356 Elim1Store]: treesize reduction 859, result has 5.3 percent of original size [2022-04-18 20:25:04,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 100 [2022-04-18 20:25:04,650 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 88 treesize of output 76 [2022-04-18 20:25:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-18 20:25:04,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:25:04,733 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1572 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse0 c_~A~0.offset) 0) (+ .cse0 c_~A~0.offset 1) 0) (+ .cse0 c_~A~0.offset 2) 0) (+ .cse0 c_~A~0.offset 3) 0))) c_~C~0.base v_ArrVal_1572) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 3)) 0)) (forall ((v_ArrVal_1572 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse1 c_~A~0.offset) 0) (+ .cse1 c_~A~0.offset 1) 0) (+ .cse1 c_~A~0.offset 2) 0) (+ .cse1 c_~A~0.offset 3) 0))) c_~C~0.base v_ArrVal_1572) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_1572 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse2 c_~A~0.offset) 0) (+ .cse2 c_~A~0.offset 1) 0) (+ .cse2 c_~A~0.offset 2) 0) (+ .cse2 c_~A~0.offset 3) 0))) c_~C~0.base v_ArrVal_1572) c_~A~0.base) (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_1572 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse3 c_~A~0.offset) 0) (+ .cse3 c_~A~0.offset 1) 0) (+ .cse3 c_~A~0.offset 2) 0) (+ .cse3 c_~A~0.offset 3) 0))) c_~C~0.base v_ArrVal_1572) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1)) 0))) is different from false [2022-04-18 20:25:04,767 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1572 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1572) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 3)) 0)) (forall ((v_ArrVal_1572 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1572) c_~A~0.base) (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_1572 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1572) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_1572 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1572) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1))))) is different from false [2022-04-18 20:25:04,800 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1572 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0 3) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1572) c_~A~0.base) (+ c_~A~0.offset .cse0))) 0)) (forall ((v_ArrVal_1572 (Array Int Int))) (= (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse1 3) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1572) c_~A~0.base) (+ c_~A~0.offset .cse1 1))) 0)) (forall ((v_ArrVal_1572 (Array Int Int))) (= (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2 3) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1572) c_~A~0.base) (+ c_~A~0.offset 2 .cse2))) 0)) (forall ((v_ArrVal_1572 (Array Int Int))) (= (let ((.cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 3))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse3 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1572) c_~A~0.base) .cse3)) 0))) is different from false [2022-04-18 20:25:04,885 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1572 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse0) 0) (+ c_~A~0.offset .cse0 3) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1572) c_~A~0.base) (+ c_~A~0.offset .cse0 1))) 0)) (forall ((v_ArrVal_1572 (Array Int Int))) (= (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset .cse1 3) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1572) c_~A~0.base) (+ c_~A~0.offset .cse1))) 0)) (forall ((v_ArrVal_1572 (Array Int Int))) (= (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (+ c_~A~0.offset .cse2 3))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse2) 0) .cse3 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1572) c_~A~0.base) .cse3))) 0)) (forall ((v_ArrVal_1572 (Array Int Int))) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (+ c_~A~0.offset 2 .cse5))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse4 0) (+ c_~A~0.offset .cse5 3) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1572) c_~A~0.base) .cse4))) 0))) is different from false [2022-04-18 20:25:04,914 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1572 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset 2 .cse0))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0 1) 0) .cse1 0) (+ c_~A~0.offset .cse0 3) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1572) c_~A~0.base) .cse1))) 0)) (forall ((v_ArrVal_1572 (Array Int Int))) (= (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset .cse2 3) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1572) c_~A~0.base) (+ c_~A~0.offset .cse2))) 0)) (forall ((v_ArrVal_1572 (Array Int Int))) (= (let ((.cse4 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (+ c_~A~0.offset .cse4 1))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse3 0) (+ c_~A~0.offset 2 .cse4) 0) (+ c_~A~0.offset .cse4 3) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1572) c_~A~0.base) .cse3))) 0)) (forall ((v_ArrVal_1572 (Array Int Int))) (= 0 (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse6 (+ c_~A~0.offset .cse5 3))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset 2 .cse5) 0) .cse6 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1572) c_~A~0.base) .cse6)))))) is different from false [2022-04-18 20:25:05,087 INFO L356 Elim1Store]: treesize reduction 1491, result has 5.7 percent of original size [2022-04-18 20:25:05,087 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 8 case distinctions, treesize of input 69 treesize of output 105 [2022-04-18 20:25:05,095 INFO L356 Elim1Store]: treesize reduction 399, result has 0.3 percent of original size [2022-04-18 20:25:05,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 121 treesize of output 55 [2022-04-18 20:25:05,099 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 10 treesize of output 3 [2022-04-18 20:25:05,174 INFO L356 Elim1Store]: treesize reduction 1580, result has 0.1 percent of original size [2022-04-18 20:25:05,174 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 8 case distinctions, treesize of input 68 treesize of output 1 [2022-04-18 20:25:05,235 INFO L356 Elim1Store]: treesize reduction 1580, result has 0.1 percent of original size [2022-04-18 20:25:05,235 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 8 case distinctions, treesize of input 69 treesize of output 1 [2022-04-18 20:25:05,296 INFO L356 Elim1Store]: treesize reduction 1580, result has 0.1 percent of original size [2022-04-18 20:25:05,296 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 8 case distinctions, treesize of input 69 treesize of output 1 [2022-04-18 20:25:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 3 not checked. [2022-04-18 20:25:05,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601169135] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:25:05,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1124047793] [2022-04-18 20:25:05,371 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 20:25:05,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:25:05,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 28 [2022-04-18 20:25:05,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179848386] [2022-04-18 20:25:05,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:25:05,372 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-18 20:25:05,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:25:05,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-18 20:25:05,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=509, Unknown=5, NotChecked=250, Total=870 [2022-04-18 20:25:05,373 INFO L87 Difference]: Start difference. First operand 6681 states and 26246 transitions. Second operand has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 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 20:25:11,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:25:11,312 INFO L93 Difference]: Finished difference Result 20481 states and 78617 transitions. [2022-04-18 20:25:11,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-18 20:25:11,313 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 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 28 [2022-04-18 20:25:11,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:25:11,374 INFO L225 Difference]: With dead ends: 20481 [2022-04-18 20:25:11,374 INFO L226 Difference]: Without dead ends: 20111 [2022-04-18 20:25:11,375 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 45 SyntacticMatches, 10 SemanticMatches, 58 ConstructedPredicates, 5 IntricatePredicates, 9 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=589, Invalid=2394, Unknown=7, NotChecked=550, Total=3540 [2022-04-18 20:25:11,376 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 752 mSDsluCounter, 2827 mSDsCounter, 0 mSdLazyCounter, 3556 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 5118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 3556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1434 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:25:11,376 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [752 Valid, 1065 Invalid, 5118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 3556 Invalid, 0 Unknown, 1434 Unchecked, 4.0s Time] [2022-04-18 20:25:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20111 states. [2022-04-18 20:25:11,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20111 to 6120. [2022-04-18 20:25:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6120 states, 6118 states have (on average 3.9128800261523375) internal successors, (23939), 6119 states have internal predecessors, (23939), 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 20:25:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 23939 transitions. [2022-04-18 20:25:11,578 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 23939 transitions. Word has length 28 [2022-04-18 20:25:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:25:11,579 INFO L478 AbstractCegarLoop]: Abstraction has 6120 states and 23939 transitions. [2022-04-18 20:25:11,579 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 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 20:25:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 23939 transitions. [2022-04-18 20:25:11,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-18 20:25:11,587 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:25:11,587 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:25:11,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-18 20:25:11,822 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,SelfDestructingSolverStorable15 [2022-04-18 20:25:11,822 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:25:11,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:25:11,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1381755376, now seen corresponding path program 6 times [2022-04-18 20:25:11,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:25:11,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584573348] [2022-04-18 20:25:11,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:25:11,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:25:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:25:12,077 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:25:12,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:25:12,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584573348] [2022-04-18 20:25:12,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584573348] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:25:12,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676498750] [2022-04-18 20:25:12,077 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:25:12,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:25:12,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:25:12,096 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 20:25:12,111 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 20:25:16,873 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:25:16,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:25:16,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-18 20:25:16,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:25:17,047 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 15 treesize of output 11 [2022-04-18 20:25:17,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,305 INFO L356 Elim1Store]: treesize reduction 318, result has 27.6 percent of original size [2022-04-18 20:25:17,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 26 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 169 [2022-04-18 20:25:17,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,538 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:25:17,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 133 treesize of output 108 [2022-04-18 20:25:17,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,666 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:25:17,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 145 treesize of output 123 [2022-04-18 20:25:17,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,813 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:25:17,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 157 treesize of output 138 [2022-04-18 20:25:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:25:17,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:25:32,315 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1750 Int) (v_ArrVal_1752 Int) (v_ArrVal_1754 Int) (~C~0.base Int) (v_ArrVal_1758 Int)) (= (select (select (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) c_~C~0.offset v_ArrVal_1750) (+ c_~C~0.offset 1) v_ArrVal_1754) (+ 2 c_~C~0.offset) v_ArrVal_1752) (+ 3 c_~C~0.offset) v_ArrVal_1758))) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) is different from false [2022-04-18 20:26:01,537 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:26:01,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676498750] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:26:01,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [728427794] [2022-04-18 20:26:01,538 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 20:26:01,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:26:01,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-04-18 20:26:01,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587647735] [2022-04-18 20:26:01,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:26:01,538 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-18 20:26:01,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:01,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-18 20:26:01,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=704, Unknown=6, NotChecked=54, Total=870 [2022-04-18 20:26:01,539 INFO L87 Difference]: Start difference. First operand 6120 states and 23939 transitions. Second operand has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 states have internal predecessors, (72), 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 20:26:04,421 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1750 Int) (v_ArrVal_1752 Int) (v_ArrVal_1754 Int) (~C~0.base Int) (v_ArrVal_1758 Int)) (= (select (select (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) c_~C~0.offset v_ArrVal_1750) (+ c_~C~0.offset 1) v_ArrVal_1754) (+ 2 c_~C~0.offset) v_ArrVal_1752) (+ 3 c_~C~0.offset) v_ArrVal_1758))) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (<= 0 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (<= c_~C~0.offset 0) (<= 0 c_~A~0.offset) (= (select (select |c_#race| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0) (not (= c_~C~0.base c_~A~0.base)) (<= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (<= 1 c_thread1Thread1of1ForFork2_~i~0)) is different from false [2022-04-18 20:26:06,731 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1750 Int) (v_ArrVal_1752 Int) (v_ArrVal_1754 Int) (~C~0.base Int) (v_ArrVal_1758 Int)) (= (select (select (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) c_~C~0.offset v_ArrVal_1750) (+ c_~C~0.offset 1) v_ArrVal_1754) (+ 2 c_~C~0.offset) v_ArrVal_1752) (+ 3 c_~C~0.offset) v_ArrVal_1758))) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (<= c_~C~0.offset 0) (<= 0 c_~A~0.offset) (= (select (select |c_#race| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0) (not (= c_~C~0.base c_~A~0.base)) (<= 1 c_thread1Thread1of1ForFork2_~i~0)) is different from false [2022-04-18 20:26:09,594 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (and (forall ((v_ArrVal_1750 Int) (v_ArrVal_1752 Int) (v_ArrVal_1754 Int) (~C~0.base Int) (v_ArrVal_1758 Int)) (= (select (select (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) c_~C~0.offset v_ArrVal_1750) (+ c_~C~0.offset 1) v_ArrVal_1754) (+ 2 c_~C~0.offset) v_ArrVal_1752) (+ 3 c_~C~0.offset) v_ArrVal_1758))) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (not (= .cse1 c_~C~0.offset)) (not (= (+ c_~C~0.offset 1) .cse1)) (= (select (select |c_#race| c_~A~0.base) .cse1) 0) (not (= .cse1 (+ 3 c_~C~0.offset))) (< (div (+ 3 c_~C~0.offset (* c_~A~0.offset (- 1))) 4) (+ c_thread1Thread1of1ForFork2_~i~0 1)) (not (= (+ 2 c_~C~0.offset) .cse1)))) is different from false [2022-04-18 20:26:11,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:11,910 INFO L93 Difference]: Finished difference Result 19405 states and 76533 transitions. [2022-04-18 20:26:11,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-18 20:26:11,910 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 states have internal predecessors, (72), 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 28 [2022-04-18 20:26:11,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:11,960 INFO L225 Difference]: With dead ends: 19405 [2022-04-18 20:26:11,961 INFO L226 Difference]: Without dead ends: 19109 [2022-04-18 20:26:11,962 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=557, Invalid=2312, Unknown=9, NotChecked=428, Total=3306 [2022-04-18 20:26:11,969 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 1020 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 2795 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 4025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 2795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 954 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:26:11,969 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1020 Valid, 838 Invalid, 4025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 2795 Invalid, 0 Unknown, 954 Unchecked, 3.1s Time] [2022-04-18 20:26:11,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19109 states. [2022-04-18 20:26:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19109 to 6897. [2022-04-18 20:26:12,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6897 states, 6895 states have (on average 3.930384336475707) internal successors, (27100), 6896 states have internal predecessors, (27100), 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 20:26:12,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6897 states to 6897 states and 27100 transitions. [2022-04-18 20:26:12,193 INFO L78 Accepts]: Start accepts. Automaton has 6897 states and 27100 transitions. Word has length 28 [2022-04-18 20:26:12,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:12,194 INFO L478 AbstractCegarLoop]: Abstraction has 6897 states and 27100 transitions. [2022-04-18 20:26:12,194 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 states have internal predecessors, (72), 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 20:26:12,194 INFO L276 IsEmpty]: Start isEmpty. Operand 6897 states and 27100 transitions. [2022-04-18 20:26:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-18 20:26:12,202 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:12,202 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:26:12,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-18 20:26:12,421 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,SelfDestructingSolverStorable16 [2022-04-18 20:26:12,421 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:26:12,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:12,422 INFO L85 PathProgramCache]: Analyzing trace with hash 742734904, now seen corresponding path program 7 times [2022-04-18 20:26:12,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:12,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61819414] [2022-04-18 20:26:12,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:12,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:12,618 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:26:12,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:12,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61819414] [2022-04-18 20:26:12,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61819414] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:26:12,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995817587] [2022-04-18 20:26:12,618 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-18 20:26:12,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:26:12,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:26:12,619 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 20:26:12,620 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 20:26:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:12,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-18 20:26:12,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:26:12,818 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:26:12,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-04-18 20:26:12,889 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 20:26:12,890 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 11 treesize of output 11 [2022-04-18 20:26:13,040 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 15 treesize of output 11 [2022-04-18 20:26:13,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,099 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 28 treesize of output 27 [2022-04-18 20:26:13,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 16 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 70 [2022-04-18 20:26:13,205 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 64 treesize of output 56 [2022-04-18 20:26:13,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,283 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:26:13,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 74 treesize of output 88 [2022-04-18 20:26:13,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:13,362 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:26:13,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 86 treesize of output 103 [2022-04-18 20:26:13,414 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-18 20:26:13,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:26:13,717 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1939 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0 1) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1939) c_~A~0.base) (+ c_~A~0.offset .cse0))) 0)) (forall ((v_ArrVal_1939 (Array Int Int))) (= (let ((.cse1 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1))) (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse1 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)) c_~C~0.base v_ArrVal_1939) c_~A~0.base) .cse1)) 0))) is different from false [2022-04-18 20:26:13,819 INFO L356 Elim1Store]: treesize reduction 631, result has 9.2 percent of original size [2022-04-18 20:26:13,819 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 53 treesize of output 79 [2022-04-18 20:26:13,825 INFO L356 Elim1Store]: treesize reduction 195, result has 0.5 percent of original size [2022-04-18 20:26:13,825 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 95 treesize of output 47 [2022-04-18 20:26:13,828 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 10 treesize of output 3 [2022-04-18 20:26:13,859 INFO L356 Elim1Store]: treesize reduction 694, result has 0.1 percent of original size [2022-04-18 20:26:13,859 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 6 case distinctions, treesize of input 52 treesize of output 1 [2022-04-18 20:26:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-04-18 20:26:13,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995817587] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:26:13,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1754910248] [2022-04-18 20:26:13,896 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 20:26:13,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:26:13,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 26 [2022-04-18 20:26:13,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797437596] [2022-04-18 20:26:13,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:26:13,897 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-18 20:26:13,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:13,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-18 20:26:13,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=568, Unknown=17, NotChecked=50, Total=756 [2022-04-18 20:26:13,897 INFO L87 Difference]: Start difference. First operand 6897 states and 27100 transitions. Second operand has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:26:17,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:17,334 INFO L93 Difference]: Finished difference Result 31142 states and 124935 transitions. [2022-04-18 20:26:17,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-18 20:26:17,334 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-04-18 20:26:17,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:17,430 INFO L225 Difference]: With dead ends: 31142 [2022-04-18 20:26:17,430 INFO L226 Difference]: Without dead ends: 30920 [2022-04-18 20:26:17,431 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 69 SyntacticMatches, 13 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=826, Invalid=2467, Unknown=17, NotChecked=112, Total=3422 [2022-04-18 20:26:17,431 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 535 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1172 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-18 20:26:17,431 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 634 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1908 Invalid, 0 Unknown, 1172 Unchecked, 1.8s Time] [2022-04-18 20:26:17,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30920 states. [2022-04-18 20:26:17,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30920 to 11742. [2022-04-18 20:26:17,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11742 states, 11740 states have (on average 4.031686541737649) internal successors, (47332), 11741 states have internal predecessors, (47332), 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 20:26:17,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11742 states to 11742 states and 47332 transitions. [2022-04-18 20:26:17,924 INFO L78 Accepts]: Start accepts. Automaton has 11742 states and 47332 transitions. Word has length 28 [2022-04-18 20:26:17,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:17,924 INFO L478 AbstractCegarLoop]: Abstraction has 11742 states and 47332 transitions. [2022-04-18 20:26:17,924 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:26:17,924 INFO L276 IsEmpty]: Start isEmpty. Operand 11742 states and 47332 transitions. [2022-04-18 20:26:17,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-18 20:26:17,933 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:17,933 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:26:17,950 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 20:26:18,149 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,10 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:26:18,150 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:26:18,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:18,151 INFO L85 PathProgramCache]: Analyzing trace with hash -492070288, now seen corresponding path program 8 times [2022-04-18 20:26:18,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:18,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783181683] [2022-04-18 20:26:18,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:18,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:26:18,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:18,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783181683] [2022-04-18 20:26:18,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783181683] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:26:18,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289131635] [2022-04-18 20:26:18,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:26:18,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:26:18,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:26:18,367 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 20:26:18,378 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 20:26:18,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:26:18,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:26:18,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-18 20:26:18,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:26:18,548 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:26:18,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-04-18 20:26:18,570 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 20:26:18,570 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 11 treesize of output 11 [2022-04-18 20:26:18,591 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 15 treesize of output 11 [2022-04-18 20:26:18,609 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-18 20:26:18,609 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 28 treesize of output 27 [2022-04-18 20:26:18,703 INFO L356 Elim1Store]: treesize reduction 756, result has 7.2 percent of original size [2022-04-18 20:26:18,704 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 83 [2022-04-18 20:26:18,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 77 treesize of output 69 [2022-04-18 20:26:23,462 INFO L356 Elim1Store]: treesize reduction 500, result has 12.4 percent of original size [2022-04-18 20:26:23,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 87 treesize of output 101 [2022-04-18 20:26:25,648 INFO L356 Elim1Store]: treesize reduction 647, result has 11.4 percent of original size [2022-04-18 20:26:25,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 99 treesize of output 116 [2022-04-18 20:26:26,454 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-18 20:26:26,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:26:26,488 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0) 0) (+ c_~A~0.offset .cse0 1) 0) (+ c_~A~0.offset .cse0 2) 0) (+ c_~A~0.offset .cse0 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1)) 0)) (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0))) is different from false [2022-04-18 20:26:26,548 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (let ((.cse0 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse0 0) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) .cse0)) 0)) (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) (+ c_~A~0.offset .cse2))) 0))) is different from false [2022-04-18 20:26:26,632 INFO L356 Elim1Store]: treesize reduction 858, result has 8.2 percent of original size [2022-04-18 20:26:26,632 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 66 treesize of output 92 [2022-04-18 20:26:26,638 INFO L356 Elim1Store]: treesize reduction 260, result has 0.4 percent of original size [2022-04-18 20:26:26,638 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 108 treesize of output 47 [2022-04-18 20:26:26,668 INFO L356 Elim1Store]: treesize reduction 934, result has 0.1 percent of original size [2022-04-18 20:26:26,668 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 6 case distinctions, treesize of input 65 treesize of output 1 [2022-04-18 20:26:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-04-18 20:26:26,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289131635] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:26:26,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [832280477] [2022-04-18 20:26:26,703 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 20:26:26,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:26:26,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2022-04-18 20:26:26,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135163520] [2022-04-18 20:26:26,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:26:26,703 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-18 20:26:26,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:26,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-18 20:26:26,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=268, Unknown=11, NotChecked=70, Total=420 [2022-04-18 20:26:26,704 INFO L87 Difference]: Start difference. First operand 11742 states and 47332 transitions. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:26:30,110 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#race| c_~A~0.base)) (.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0) 0) (+ c_~A~0.offset .cse0 1) 0) (+ c_~A~0.offset .cse0 2) 0) (+ c_~A~0.offset .cse0 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1)) 0)) (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (= (select .cse2 (+ c_~A~0.offset .cse3)) 0) (not (= c_~C~0.base c_~A~0.base)) (= c_thread1Thread1of1ForFork2_~i~0 0) (= (select .cse2 (+ c_~A~0.offset .cse3 1)) 0))) is different from false [2022-04-18 20:26:31,241 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#race| c_~A~0.base)) (.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0) 0) (+ c_~A~0.offset .cse0 1) 0) (+ c_~A~0.offset .cse0 2) 0) (+ c_~A~0.offset .cse0 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1)) 0)) (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (= (select .cse2 (+ c_~A~0.offset .cse3)) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse2 (+ c_~A~0.offset .cse3 1)) 0))) is different from false [2022-04-18 20:26:38,891 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#race| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (let ((.cse0 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse0 0) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) .cse0)) 0)) (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) (+ c_~A~0.offset .cse2))) 0)) (<= 1 c_thread1Thread1of1ForFork2_~i~0)) is different from false [2022-04-18 20:26:42,169 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#race| c_~A~0.base)) (.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0) 0) (+ c_~A~0.offset .cse0 1) 0) (+ c_~A~0.offset .cse0 2) 0) (+ c_~A~0.offset .cse0 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1)) 0)) (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (= (select .cse2 (+ c_~A~0.offset .cse3)) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse2 (+ c_~A~0.offset .cse3 1)) 0) (<= 1 c_thread1Thread1of1ForFork2_~i~0))) is different from false [2022-04-18 20:26:43,560 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#race| c_~A~0.base)) (.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0) 0) (+ c_~A~0.offset .cse0 1) 0) (+ c_~A~0.offset .cse0 2) 0) (+ c_~A~0.offset .cse0 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1)) 0)) (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (= (select .cse2 (+ c_~A~0.offset .cse3)) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse2 (+ c_~A~0.offset .cse3 1)) 0) (not (<= c_thread1Thread1of1ForFork2_~i~0 c_thread2Thread1of1ForFork0_~i~1)))) is different from false [2022-04-18 20:26:44,498 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#race| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (let ((.cse0 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse0 0) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) .cse0)) 0)) (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) (+ c_~A~0.offset .cse2))) 0))) is different from false [2022-04-18 20:26:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:44,696 INFO L93 Difference]: Finished difference Result 24998 states and 99264 transitions. [2022-04-18 20:26:44,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-18 20:26:44,697 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-04-18 20:26:44,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:44,779 INFO L225 Difference]: With dead ends: 24998 [2022-04-18 20:26:44,779 INFO L226 Difference]: Without dead ends: 24959 [2022-04-18 20:26:44,780 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=181, Invalid=639, Unknown=24, NotChecked=488, Total=1332 [2022-04-18 20:26:44,780 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 379 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 3404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2196 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:26:44,781 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 438 Invalid, 3404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1154 Invalid, 0 Unknown, 2196 Unchecked, 1.2s Time] [2022-04-18 20:26:44,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24959 states. [2022-04-18 20:26:45,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24959 to 13853. [2022-04-18 20:26:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13853 states, 13851 states have (on average 4.055302866219045) internal successors, (56170), 13852 states have internal predecessors, (56170), 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 20:26:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13853 states to 13853 states and 56170 transitions. [2022-04-18 20:26:45,157 INFO L78 Accepts]: Start accepts. Automaton has 13853 states and 56170 transitions. Word has length 28 [2022-04-18 20:26:45,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:45,157 INFO L478 AbstractCegarLoop]: Abstraction has 13853 states and 56170 transitions. [2022-04-18 20:26:45,157 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:26:45,158 INFO L276 IsEmpty]: Start isEmpty. Operand 13853 states and 56170 transitions. [2022-04-18 20:26:45,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-18 20:26:45,168 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:45,168 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:26:45,186 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 20:26:45,370 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:26:45,370 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:26:45,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:45,370 INFO L85 PathProgramCache]: Analyzing trace with hash -498412888, now seen corresponding path program 9 times [2022-04-18 20:26:45,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:45,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824582734] [2022-04-18 20:26:45,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:45,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:26:45,577 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:45,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824582734] [2022-04-18 20:26:45,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824582734] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:26:45,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022741711] [2022-04-18 20:26:45,577 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:26:45,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:26:45,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:26:45,578 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 20:26:45,578 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 20:26:52,098 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:26:52,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:26:52,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-18 20:26:52,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:26:52,299 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 15 treesize of output 11 [2022-04-18 20:26:52,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,330 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 28 treesize of output 27 [2022-04-18 20:26:52,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,434 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:26:52,434 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 1 case distinctions, treesize of input 40 treesize of output 42 [2022-04-18 20:26:52,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,712 INFO L356 Elim1Store]: treesize reduction 318, result has 27.6 percent of original size [2022-04-18 20:26:52,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 45 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 108 treesize of output 199 [2022-04-18 20:26:52,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:26:52,910 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:26:52,910 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 3 case distinctions, treesize of input 52 treesize of output 57 [2022-04-18 20:26:52,948 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:26:52,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:26:55,026 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (let ((.cse1 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse1 c_~A~0.offset) 0) (+ .cse1 c_~A~0.offset 1) 0) (+ .cse1 c_~A~0.offset 2) 0) (+ .cse1 c_~A~0.offset 3) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) (+ .cse1 c_~C~0.offset) v_ArrVal_2311) (+ .cse1 c_~C~0.offset 1) v_ArrVal_2315) (+ .cse1 2 c_~C~0.offset) v_ArrVal_2313) (+ .cse1 3 c_~C~0.offset) v_ArrVal_2303)))) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (let ((.cse3 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse3 c_~A~0.offset) 0) (+ .cse3 c_~A~0.offset 1) 0) (+ .cse3 c_~A~0.offset 2) 0) (+ .cse3 c_~A~0.offset 3) 0)))) (store .cse2 ~C~0.base (store (store (store (store (select .cse2 ~C~0.base) (+ .cse3 c_~C~0.offset) v_ArrVal_2311) (+ .cse3 c_~C~0.offset 1) v_ArrVal_2315) (+ .cse3 2 c_~C~0.offset) v_ArrVal_2313) (+ .cse3 3 c_~C~0.offset) v_ArrVal_2303)))) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1)) 0)) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (let ((.cse5 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse5 c_~A~0.offset) 0) (+ .cse5 c_~A~0.offset 1) 0) (+ .cse5 c_~A~0.offset 2) 0) (+ .cse5 c_~A~0.offset 3) 0)))) (store .cse4 ~C~0.base (store (store (store (store (select .cse4 ~C~0.base) (+ .cse5 c_~C~0.offset) v_ArrVal_2311) (+ .cse5 c_~C~0.offset 1) v_ArrVal_2315) (+ .cse5 2 c_~C~0.offset) v_ArrVal_2313) (+ .cse5 3 c_~C~0.offset) v_ArrVal_2303)))) c_~A~0.base) (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4))) 0))) is different from false [2022-04-18 20:27:15,584 WARN L232 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-18 20:27:35,319 WARN L232 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-18 20:27:56,063 WARN L232 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 50 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-18 20:27:58,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:27:58,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:27:58,242 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:27:58,242 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:27:58,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:27:58,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:27:58,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:28:12,910 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 2 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:28:12,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022741711] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:28:12,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1007111272] [2022-04-18 20:28:12,911 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 20:28:12,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:28:12,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 11] total 33 [2022-04-18 20:28:12,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704916809] [2022-04-18 20:28:12,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:28:12,912 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-18 20:28:12,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:28:12,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-18 20:28:12,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=963, Unknown=21, NotChecked=64, Total=1190 [2022-04-18 20:28:12,912 INFO L87 Difference]: Start difference. First operand 13853 states and 56170 transitions. Second operand has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 34 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:28:16,222 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (= (select .cse0 (+ c_~A~0.offset 2 .cse1)) 0) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (let ((.cse3 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse3 c_~A~0.offset) 0) (+ .cse3 c_~A~0.offset 1) 0) (+ .cse3 c_~A~0.offset 2) 0) (+ .cse3 c_~A~0.offset 3) 0)))) (store .cse2 ~C~0.base (store (store (store (store (select .cse2 ~C~0.base) (+ .cse3 c_~C~0.offset) v_ArrVal_2311) (+ .cse3 c_~C~0.offset 1) v_ArrVal_2315) (+ .cse3 2 c_~C~0.offset) v_ArrVal_2313) (+ .cse3 3 c_~C~0.offset) v_ArrVal_2303)))) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (<= c_~C~0.offset 0) (= (select .cse0 (+ c_~A~0.offset .cse1)) 0) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (let ((.cse5 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse5 c_~A~0.offset) 0) (+ .cse5 c_~A~0.offset 1) 0) (+ .cse5 c_~A~0.offset 2) 0) (+ .cse5 c_~A~0.offset 3) 0)))) (store .cse4 ~C~0.base (store (store (store (store (select .cse4 ~C~0.base) (+ .cse5 c_~C~0.offset) v_ArrVal_2311) (+ .cse5 c_~C~0.offset 1) v_ArrVal_2315) (+ .cse5 2 c_~C~0.offset) v_ArrVal_2313) (+ .cse5 3 c_~C~0.offset) v_ArrVal_2303)))) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1)) 0)) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 (+ c_~A~0.offset .cse1 1)) 0) (not (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| c_~A~0.base)) (= c_~A~0.offset 0) (not (<= c_thread1Thread1of1ForFork2_~i~0 c_thread2Thread1of1ForFork0_~i~1)) (= c_thread1Thread1of1ForFork2_~i~0 1) (= c_thread2Thread1of1ForFork0_~i~1 0) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (let ((.cse7 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse6 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse7 c_~A~0.offset) 0) (+ .cse7 c_~A~0.offset 1) 0) (+ .cse7 c_~A~0.offset 2) 0) (+ .cse7 c_~A~0.offset 3) 0)))) (store .cse6 ~C~0.base (store (store (store (store (select .cse6 ~C~0.base) (+ .cse7 c_~C~0.offset) v_ArrVal_2311) (+ .cse7 c_~C~0.offset 1) v_ArrVal_2315) (+ .cse7 2 c_~C~0.offset) v_ArrVal_2313) (+ .cse7 3 c_~C~0.offset) v_ArrVal_2303)))) c_~A~0.base) (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (<= 1 c_thread1Thread1of1ForFork2_~i~0))) is different from false [2022-04-18 20:28:18,805 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (+ 2 c_~C~0.offset)) (.cse8 (+ c_~C~0.offset 1)) (.cse2 (+ c_~A~0.offset .cse3 4)) (.cse4 (+ 3 c_~C~0.offset)) (.cse1 (+ c_~A~0.offset 4))) (and (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (not (= .cse0 .cse2)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (not (= (+ c_~A~0.offset 5 .cse3) c_~C~0.offset)) (not (= .cse1 .cse4)) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse7 (+ c_~A~0.offset 2 .cse6))) (select (select (let ((.cse5 (store |c_#race| c_~A~0.base (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse6 1) 0) .cse7 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse5 ~C~0.base (store (store (store (store (select .cse5 ~C~0.base) c_~C~0.offset v_ArrVal_2311) (+ c_~C~0.offset 1) v_ArrVal_2315) (+ 2 c_~C~0.offset) v_ArrVal_2313) (+ 3 c_~C~0.offset) v_ArrVal_2303))) c_~A~0.base) .cse7))) 0)) (not (= .cse8 .cse2)) (= (select (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3)) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= c_~C~0.offset .cse2)) (not (= .cse8 .cse1)) (not (= .cse2 .cse4)) (not (= (+ c_~A~0.offset 6) c_~C~0.offset)) (not (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| c_~A~0.base)) (not (= c_~C~0.offset .cse1)) (= c_~A~0.offset 0) (not (= c_~C~0.offset (+ c_~A~0.offset .cse3 6))) (not (= c_~C~0.offset (+ c_~A~0.offset 5))) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= 0 (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (let ((.cse9 (store |c_#race| c_~A~0.base (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse10 1) 0) (+ c_~A~0.offset 2 .cse10) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse9 ~C~0.base (store (store (store (store (select .cse9 ~C~0.base) c_~C~0.offset v_ArrVal_2311) (+ c_~C~0.offset 1) v_ArrVal_2315) (+ 2 c_~C~0.offset) v_ArrVal_2313) (+ 3 c_~C~0.offset) v_ArrVal_2303))) c_~A~0.base) (+ c_~A~0.offset .cse10))))) (<= 1 c_thread1Thread1of1ForFork2_~i~0)))) is different from false [2022-04-18 20:28:21,114 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset .cse3 4))) (and (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse1) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) c_~C~0.offset v_ArrVal_2311) (+ c_~C~0.offset 1) v_ArrVal_2315) (+ 2 c_~C~0.offset) v_ArrVal_2313) (+ 3 c_~C~0.offset) v_ArrVal_2303))) c_~A~0.base) (+ c_~A~0.offset .cse1))) 0)) (not (= (+ 2 c_~C~0.offset) .cse2)) (not (= (+ c_~A~0.offset 5 .cse3) c_~C~0.offset)) (not (= (+ c_~C~0.offset 1) .cse2)) (= (select .cse4 (+ c_~A~0.offset .cse3)) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (let ((.cse5 (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse6) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse5 ~C~0.base (store (store (store (store (select .cse5 ~C~0.base) c_~C~0.offset v_ArrVal_2311) (+ c_~C~0.offset 1) v_ArrVal_2315) (+ 2 c_~C~0.offset) v_ArrVal_2313) (+ 3 c_~C~0.offset) v_ArrVal_2303))) c_~A~0.base) (+ c_~A~0.offset .cse6 1))) 0)) (not (= c_~C~0.offset .cse2)) (= (select .cse4 (+ c_~A~0.offset .cse3 1)) 0) (not (= .cse2 (+ 3 c_~C~0.offset))) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (let ((.cse8 (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4)))) (select (select (let ((.cse7 (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse8 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse7 ~C~0.base (store (store (store (store (select .cse7 ~C~0.base) c_~C~0.offset v_ArrVal_2311) (+ c_~C~0.offset 1) v_ArrVal_2315) (+ 2 c_~C~0.offset) v_ArrVal_2313) (+ 3 c_~C~0.offset) v_ArrVal_2303))) c_~A~0.base) .cse8)) 0)) (not (= c_~C~0.offset (+ c_~A~0.offset .cse3 6))) (<= 1 c_thread1Thread1of1ForFork2_~i~0)))) is different from false [2022-04-18 20:28:24,085 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#race| c_~A~0.base)) (.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse1) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) c_~C~0.offset v_ArrVal_2311) (+ c_~C~0.offset 1) v_ArrVal_2315) (+ 2 c_~C~0.offset) v_ArrVal_2313) (+ 3 c_~C~0.offset) v_ArrVal_2303))) c_~A~0.base) (+ c_~A~0.offset .cse1))) 0)) (= (select .cse2 (+ c_~A~0.offset .cse3)) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse5) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse4 ~C~0.base (store (store (store (store (select .cse4 ~C~0.base) c_~C~0.offset v_ArrVal_2311) (+ c_~C~0.offset 1) v_ArrVal_2315) (+ 2 c_~C~0.offset) v_ArrVal_2313) (+ 3 c_~C~0.offset) v_ArrVal_2303))) c_~A~0.base) (+ c_~A~0.offset .cse5 1))) 0)) (= (select .cse2 (+ c_~A~0.offset .cse3 1)) 0) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (let ((.cse7 (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4)))) (select (select (let ((.cse6 (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse7 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse6 ~C~0.base (store (store (store (store (select .cse6 ~C~0.base) c_~C~0.offset v_ArrVal_2311) (+ c_~C~0.offset 1) v_ArrVal_2315) (+ 2 c_~C~0.offset) v_ArrVal_2313) (+ 3 c_~C~0.offset) v_ArrVal_2303))) c_~A~0.base) .cse7)) 0)) (<= 1 c_thread1Thread1of1ForFork2_~i~0))) is different from false [2022-04-18 20:28:26,828 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#race| c_~A~0.base)) (.cse4 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (let ((.cse1 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse2) 0) (+ .cse1 c_~A~0.offset) 0) (+ .cse1 c_~A~0.offset 1) 0) (+ .cse1 c_~A~0.offset 2) 0) (+ .cse1 c_~A~0.offset 3) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) (+ .cse1 c_~C~0.offset) v_ArrVal_2311) (+ .cse1 c_~C~0.offset 1) v_ArrVal_2315) (+ .cse1 2 c_~C~0.offset) v_ArrVal_2313) (+ .cse1 3 c_~C~0.offset) v_ArrVal_2303)))) c_~A~0.base) (+ c_~A~0.offset .cse2 1))) 0)) (= (select .cse3 (+ c_~A~0.offset .cse4)) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse3 (+ c_~A~0.offset .cse4 1)) 0) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (let ((.cse7 (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4)))) (select (select (let ((.cse6 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse5 (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse7 0) (+ .cse6 c_~A~0.offset) 0) (+ .cse6 c_~A~0.offset 1) 0) (+ .cse6 c_~A~0.offset 2) 0) (+ .cse6 c_~A~0.offset 3) 0)))) (store .cse5 ~C~0.base (store (store (store (store (select .cse5 ~C~0.base) (+ .cse6 c_~C~0.offset) v_ArrVal_2311) (+ .cse6 c_~C~0.offset 1) v_ArrVal_2315) (+ .cse6 2 c_~C~0.offset) v_ArrVal_2313) (+ .cse6 3 c_~C~0.offset) v_ArrVal_2303)))) c_~A~0.base) .cse7)) 0)) (not (<= c_thread1Thread1of1ForFork2_~i~0 c_thread2Thread1of1ForFork0_~i~1)) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (let ((.cse9 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse8 (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse10) 0) (+ .cse9 c_~A~0.offset) 0) (+ .cse9 c_~A~0.offset 1) 0) (+ .cse9 c_~A~0.offset 2) 0) (+ .cse9 c_~A~0.offset 3) 0)))) (store .cse8 ~C~0.base (store (store (store (store (select .cse8 ~C~0.base) (+ .cse9 c_~C~0.offset) v_ArrVal_2311) (+ .cse9 c_~C~0.offset 1) v_ArrVal_2315) (+ .cse9 2 c_~C~0.offset) v_ArrVal_2313) (+ .cse9 3 c_~C~0.offset) v_ArrVal_2303)))) c_~A~0.base) (+ c_~A~0.offset .cse10))) 0)))) is different from false [2022-04-18 20:28:29,055 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (+ 2 c_~C~0.offset)) (.cse8 (+ c_~C~0.offset 1)) (.cse2 (+ c_~A~0.offset .cse3 4)) (.cse4 (+ 3 c_~C~0.offset)) (.cse1 (+ c_~A~0.offset 4))) (and (not (= .cse0 .cse1)) (not (= .cse0 .cse2)) (not (= (+ c_~A~0.offset 5 .cse3) c_~C~0.offset)) (not (= .cse1 .cse4)) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse7 (+ c_~A~0.offset 2 .cse6))) (select (select (let ((.cse5 (store |c_#race| c_~A~0.base (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse6 1) 0) .cse7 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse5 ~C~0.base (store (store (store (store (select .cse5 ~C~0.base) c_~C~0.offset v_ArrVal_2311) (+ c_~C~0.offset 1) v_ArrVal_2315) (+ 2 c_~C~0.offset) v_ArrVal_2313) (+ 3 c_~C~0.offset) v_ArrVal_2303))) c_~A~0.base) .cse7))) 0)) (not (= .cse8 .cse2)) (= (select (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3)) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= c_~C~0.offset .cse2)) (not (= .cse8 .cse1)) (not (= .cse2 .cse4)) (not (= (+ c_~A~0.offset 6) c_~C~0.offset)) (not (= c_~C~0.offset .cse1)) (not (= c_~C~0.offset (+ c_~A~0.offset .cse3 6))) (not (= c_~C~0.offset (+ c_~A~0.offset 5))) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= 0 (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (let ((.cse9 (store |c_#race| c_~A~0.base (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse10 1) 0) (+ c_~A~0.offset 2 .cse10) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse9 ~C~0.base (store (store (store (store (select .cse9 ~C~0.base) c_~C~0.offset v_ArrVal_2311) (+ c_~C~0.offset 1) v_ArrVal_2315) (+ 2 c_~C~0.offset) v_ArrVal_2313) (+ 3 c_~C~0.offset) v_ArrVal_2303))) c_~A~0.base) (+ c_~A~0.offset .cse10))))) (<= 1 c_thread1Thread1of1ForFork2_~i~0)))) is different from false [2022-04-18 20:28:31,318 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (= (select .cse0 (+ c_~A~0.offset 2 .cse1)) 0) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (let ((.cse3 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse3 c_~A~0.offset) 0) (+ .cse3 c_~A~0.offset 1) 0) (+ .cse3 c_~A~0.offset 2) 0) (+ .cse3 c_~A~0.offset 3) 0)))) (store .cse2 ~C~0.base (store (store (store (store (select .cse2 ~C~0.base) (+ .cse3 c_~C~0.offset) v_ArrVal_2311) (+ .cse3 c_~C~0.offset 1) v_ArrVal_2315) (+ .cse3 2 c_~C~0.offset) v_ArrVal_2313) (+ .cse3 3 c_~C~0.offset) v_ArrVal_2303)))) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (= (select .cse0 (+ c_~A~0.offset .cse1)) 0) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (let ((.cse5 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse5 c_~A~0.offset) 0) (+ .cse5 c_~A~0.offset 1) 0) (+ .cse5 c_~A~0.offset 2) 0) (+ .cse5 c_~A~0.offset 3) 0)))) (store .cse4 ~C~0.base (store (store (store (store (select .cse4 ~C~0.base) (+ .cse5 c_~C~0.offset) v_ArrVal_2311) (+ .cse5 c_~C~0.offset 1) v_ArrVal_2315) (+ .cse5 2 c_~C~0.offset) v_ArrVal_2313) (+ .cse5 3 c_~C~0.offset) v_ArrVal_2303)))) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1)) 0)) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 (+ c_~A~0.offset .cse1 1)) 0) (not (<= c_thread1Thread1of1ForFork2_~i~0 c_thread2Thread1of1ForFork0_~i~1)) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (let ((.cse7 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse6 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse7 c_~A~0.offset) 0) (+ .cse7 c_~A~0.offset 1) 0) (+ .cse7 c_~A~0.offset 2) 0) (+ .cse7 c_~A~0.offset 3) 0)))) (store .cse6 ~C~0.base (store (store (store (store (select .cse6 ~C~0.base) (+ .cse7 c_~C~0.offset) v_ArrVal_2311) (+ .cse7 c_~C~0.offset 1) v_ArrVal_2315) (+ .cse7 2 c_~C~0.offset) v_ArrVal_2313) (+ .cse7 3 c_~C~0.offset) v_ArrVal_2303)))) c_~A~0.base) (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)))) is different from false [2022-04-18 20:28:34,426 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset 4))) (and (not (= (+ 2 c_~C~0.offset) .cse0)) (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (not (= .cse0 (+ 3 c_~C~0.offset))) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (+ c_~A~0.offset 2 .cse2))) (select (select (let ((.cse1 (store |c_#race| c_~A~0.base (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2 1) 0) .cse3 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse1 ~C~0.base (store (store (store (store (select .cse1 ~C~0.base) c_~C~0.offset v_ArrVal_2311) (+ c_~C~0.offset 1) v_ArrVal_2315) (+ 2 c_~C~0.offset) v_ArrVal_2313) (+ 3 c_~C~0.offset) v_ArrVal_2303))) c_~A~0.base) .cse3))) 0)) (= (select (select |c_#race| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= (+ c_~C~0.offset 1) .cse0)) (not (= (+ c_~A~0.offset 6) c_~C~0.offset)) (not (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| c_~A~0.base)) (not (= c_~C~0.offset .cse0)) (= c_~A~0.offset 0) (not (= c_~C~0.offset (+ c_~A~0.offset 5))) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= 0 (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset 2 .cse5) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse4 ~C~0.base (store (store (store (store (select .cse4 ~C~0.base) c_~C~0.offset v_ArrVal_2311) (+ c_~C~0.offset 1) v_ArrVal_2315) (+ 2 c_~C~0.offset) v_ArrVal_2313) (+ 3 c_~C~0.offset) v_ArrVal_2303))) c_~A~0.base) (+ c_~A~0.offset .cse5))))) (<= 1 c_thread1Thread1of1ForFork2_~i~0))) is different from false [2022-04-18 20:28:37,170 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse1) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) c_~C~0.offset v_ArrVal_2311) (+ c_~C~0.offset 1) v_ArrVal_2315) (+ 2 c_~C~0.offset) v_ArrVal_2313) (+ 3 c_~C~0.offset) v_ArrVal_2303))) c_~A~0.base) (+ c_~A~0.offset .cse1))) 0)) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (let ((.cse4 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (let ((.cse3 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse4) 0) (+ .cse3 c_~A~0.offset) 0) (+ .cse3 c_~A~0.offset 1) 0) (+ .cse3 c_~A~0.offset 2) 0) (+ .cse3 c_~A~0.offset 3) 0)))) (store .cse2 ~C~0.base (store (store (store (store (select .cse2 ~C~0.base) (+ .cse3 c_~C~0.offset) v_ArrVal_2311) (+ .cse3 c_~C~0.offset 1) v_ArrVal_2315) (+ .cse3 2 c_~C~0.offset) v_ArrVal_2313) (+ .cse3 3 c_~C~0.offset) v_ArrVal_2303)))) c_~A~0.base) (+ c_~A~0.offset .cse4 1))) 0)) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (let ((.cse5 (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse6) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse5 ~C~0.base (store (store (store (store (select .cse5 ~C~0.base) c_~C~0.offset v_ArrVal_2311) (+ c_~C~0.offset 1) v_ArrVal_2315) (+ 2 c_~C~0.offset) v_ArrVal_2313) (+ 3 c_~C~0.offset) v_ArrVal_2303))) c_~A~0.base) (+ c_~A~0.offset .cse6 1))) 0)) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (let ((.cse9 (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4)))) (select (select (let ((.cse8 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse7 (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse9 0) (+ .cse8 c_~A~0.offset) 0) (+ .cse8 c_~A~0.offset 1) 0) (+ .cse8 c_~A~0.offset 2) 0) (+ .cse8 c_~A~0.offset 3) 0)))) (store .cse7 ~C~0.base (store (store (store (store (select .cse7 ~C~0.base) (+ .cse8 c_~C~0.offset) v_ArrVal_2311) (+ .cse8 c_~C~0.offset 1) v_ArrVal_2315) (+ .cse8 2 c_~C~0.offset) v_ArrVal_2313) (+ .cse8 3 c_~C~0.offset) v_ArrVal_2303)))) c_~A~0.base) .cse9)) 0)) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (let ((.cse11 (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4)))) (select (select (let ((.cse10 (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse11 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse10 ~C~0.base (store (store (store (store (select .cse10 ~C~0.base) c_~C~0.offset v_ArrVal_2311) (+ c_~C~0.offset 1) v_ArrVal_2315) (+ 2 c_~C~0.offset) v_ArrVal_2313) (+ 3 c_~C~0.offset) v_ArrVal_2303))) c_~A~0.base) .cse11)) 0)) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (let ((.cse14 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (let ((.cse13 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse12 (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse14) 0) (+ .cse13 c_~A~0.offset) 0) (+ .cse13 c_~A~0.offset 1) 0) (+ .cse13 c_~A~0.offset 2) 0) (+ .cse13 c_~A~0.offset 3) 0)))) (store .cse12 ~C~0.base (store (store (store (store (select .cse12 ~C~0.base) (+ .cse13 c_~C~0.offset) v_ArrVal_2311) (+ .cse13 c_~C~0.offset 1) v_ArrVal_2315) (+ .cse13 2 c_~C~0.offset) v_ArrVal_2313) (+ .cse13 3 c_~C~0.offset) v_ArrVal_2303)))) c_~A~0.base) (+ c_~A~0.offset .cse14))) 0))) is different from false [2022-04-18 20:28:39,971 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset 4))) (and (not (= (+ 2 c_~C~0.offset) .cse0)) (not (= .cse0 (+ 3 c_~C~0.offset))) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (+ c_~A~0.offset 2 .cse2))) (select (select (let ((.cse1 (store |c_#race| c_~A~0.base (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2 1) 0) .cse3 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse1 ~C~0.base (store (store (store (store (select .cse1 ~C~0.base) c_~C~0.offset v_ArrVal_2311) (+ c_~C~0.offset 1) v_ArrVal_2315) (+ 2 c_~C~0.offset) v_ArrVal_2313) (+ 3 c_~C~0.offset) v_ArrVal_2303))) c_~A~0.base) .cse3))) 0)) (= (select (select |c_#race| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= (+ c_~C~0.offset 1) .cse0)) (not (= (+ c_~A~0.offset 6) c_~C~0.offset)) (not (= c_~C~0.offset .cse0)) (not (= c_~C~0.offset (+ c_~A~0.offset 5))) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= 0 (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset 2 .cse5) 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (store .cse4 ~C~0.base (store (store (store (store (select .cse4 ~C~0.base) c_~C~0.offset v_ArrVal_2311) (+ c_~C~0.offset 1) v_ArrVal_2315) (+ 2 c_~C~0.offset) v_ArrVal_2313) (+ 3 c_~C~0.offset) v_ArrVal_2303))) c_~A~0.base) (+ c_~A~0.offset .cse5))))) (<= 1 c_thread1Thread1of1ForFork2_~i~0))) is different from false [2022-04-18 20:28:41,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:28:41,019 INFO L93 Difference]: Finished difference Result 56312 states and 228031 transitions. [2022-04-18 20:28:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-04-18 20:28:41,020 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 34 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-04-18 20:28:41,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:28:41,252 INFO L225 Difference]: With dead ends: 56312 [2022-04-18 20:28:41,252 INFO L226 Difference]: Without dead ends: 55317 [2022-04-18 20:28:41,254 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 2184 ImplicationChecksByTransitivity, 101.8s TimeCoverageRelationStatistics Valid=1284, Invalid=5371, Unknown=31, NotChecked=1870, Total=8556 [2022-04-18 20:28:41,256 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 2196 mSDsluCounter, 2649 mSDsCounter, 0 mSdLazyCounter, 2790 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2196 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 4868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 2790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1623 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-18 20:28:41,256 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2196 Valid, 966 Invalid, 4868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 2790 Invalid, 0 Unknown, 1623 Unchecked, 3.3s Time] [2022-04-18 20:28:41,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55317 states. [2022-04-18 20:28:42,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55317 to 19381. [2022-04-18 20:28:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19381 states, 19379 states have (on average 4.079828680530471) internal successors, (79063), 19380 states have internal predecessors, (79063), 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 20:28:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19381 states to 19381 states and 79063 transitions. [2022-04-18 20:28:42,111 INFO L78 Accepts]: Start accepts. Automaton has 19381 states and 79063 transitions. Word has length 28 [2022-04-18 20:28:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:28:42,111 INFO L478 AbstractCegarLoop]: Abstraction has 19381 states and 79063 transitions. [2022-04-18 20:28:42,111 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 34 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:28:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 19381 states and 79063 transitions. [2022-04-18 20:28:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-18 20:28:42,121 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:28:42,121 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:28:42,143 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 20:28:42,324 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,SelfDestructingSolverStorable19 [2022-04-18 20:28:42,324 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:28:42,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:28:42,326 INFO L85 PathProgramCache]: Analyzing trace with hash -498616558, now seen corresponding path program 10 times [2022-04-18 20:28:42,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:28:42,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274895354] [2022-04-18 20:28:42,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:28:42,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:28:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:28:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:28:42,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:28:42,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274895354] [2022-04-18 20:28:42,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274895354] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:28:42,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317458491] [2022-04-18 20:28:42,534 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-18 20:28:42,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:28:42,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:28:42,535 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 20:28:42,536 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 20:28:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:28:42,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-18 20:28:42,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:28:42,758 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:28:42,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-04-18 20:28:42,781 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 20:28:42,781 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 11 treesize of output 11 [2022-04-18 20:28:42,845 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 15 treesize of output 11 [2022-04-18 20:28:42,860 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-18 20:28:42,861 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 28 treesize of output 27 [2022-04-18 20:28:42,934 INFO L356 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-04-18 20:28:42,934 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 40 treesize of output 42 [2022-04-18 20:28:42,991 INFO L356 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-04-18 20:28:42,991 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 52 treesize of output 57 [2022-04-18 20:28:43,166 INFO L356 Elim1Store]: treesize reduction 1318, result has 5.9 percent of original size [2022-04-18 20:28:43,166 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 5 new quantified variables, introduced 13 case distinctions, treesize of input 90 treesize of output 113 [2022-04-18 20:28:43,170 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 101 treesize of output 89 [2022-04-18 20:28:47,225 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:28:47,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:28:47,630 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse0) 0) (+ c_~A~0.offset .cse0 3) 0) (+ .cse1 c_~A~0.offset) 0) (+ .cse1 c_~A~0.offset 1) 0) (+ .cse1 c_~A~0.offset 2) 0) (+ .cse1 c_~A~0.offset 3) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse0 1))) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset .cse2 3) 0) (+ .cse3 c_~A~0.offset) 0) (+ .cse3 c_~A~0.offset 1) 0) (+ .cse3 c_~A~0.offset 2) 0) (+ .cse3 c_~A~0.offset 3) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse2))) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (+ c_~A~0.offset 2 .cse5))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse4 0) (+ c_~A~0.offset .cse5 3) 0) (+ .cse6 c_~A~0.offset) 0) (+ .cse6 c_~A~0.offset 1) 0) (+ .cse6 c_~A~0.offset 2) 0) (+ .cse6 c_~A~0.offset 3) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse4))) 0))) is different from false [2022-04-18 20:28:49,684 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_thread2Thread1of1ForFork0_~i~1_496 Int)) (or (and (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse0) 0) (+ c_~A~0.offset .cse0 3) 0) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse0))) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset 2 .cse3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse2 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset 2 .cse4) 0) (+ c_~A~0.offset 3 .cse4) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse2))) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset .cse5 3) 0) (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset 2 .cse6) 0) (+ c_~A~0.offset 3 .cse6) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse5 1))) 0))) (not (<= v_thread2Thread1of1ForFork0_~i~1_496 0)))) is different from false [2022-04-18 20:28:49,764 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_thread2Thread1of1ForFork0_~i~1_496 Int)) (or (and (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset 2 .cse0))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0 1) 0) .cse1 0) (+ c_~A~0.offset .cse0 3) 0) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset 3 .cse2) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse1))) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset 2 .cse4) 0) (+ c_~A~0.offset 3 .cse4) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse3))) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (+ c_~A~0.offset .cse6 1))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse5 0) (+ c_~A~0.offset 2 .cse6) 0) (+ c_~A~0.offset .cse6 3) 0) (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset 2 .cse7) 0) (+ c_~A~0.offset 3 .cse7) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse5))) 0))) (not (<= v_thread2Thread1of1ForFork0_~i~1_496 0)))) is different from false [2022-04-18 20:28:49,943 INFO L356 Elim1Store]: treesize reduction 1871, result has 5.2 percent of original size [2022-04-18 20:28:49,944 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 8 case distinctions, treesize of input 82 treesize of output 118 [2022-04-18 20:28:49,950 INFO L356 Elim1Store]: treesize reduction 490, result has 0.2 percent of original size [2022-04-18 20:28:49,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 55 [2022-04-18 20:28:49,953 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 10 treesize of output 3 [2022-04-18 20:28:50,015 INFO L356 Elim1Store]: treesize reduction 1973, result has 0.1 percent of original size [2022-04-18 20:28:50,015 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 8 case distinctions, treesize of input 81 treesize of output 1 [2022-04-18 20:28:50,090 INFO L356 Elim1Store]: treesize reduction 1973, result has 0.1 percent of original size [2022-04-18 20:28: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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 82 treesize of output 1 [2022-04-18 20:28:50,135 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2022-04-18 20:28:50,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317458491] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:28:50,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [857175152] [2022-04-18 20:28:50,136 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 20:28:50,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:28:50,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 22 [2022-04-18 20:28:50,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18386810] [2022-04-18 20:28:50,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:28:50,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-18 20:28:50,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:28:50,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-18 20:28:50,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=318, Unknown=15, NotChecked=120, Total=552 [2022-04-18 20:28:50,137 INFO L87 Difference]: Start difference. First operand 19381 states and 79063 transitions. Second operand has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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 20:28:51,102 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork0_~i~1_496 Int)) (or (and (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset 2 .cse0))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0 1) 0) .cse1 0) (+ c_~A~0.offset .cse0 3) 0) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset 3 .cse2) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse1))) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset 2 .cse4) 0) (+ c_~A~0.offset 3 .cse4) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse3))) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (+ c_~A~0.offset .cse6 1))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse5 0) (+ c_~A~0.offset 2 .cse6) 0) (+ c_~A~0.offset .cse6 3) 0) (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset 2 .cse7) 0) (+ c_~A~0.offset 3 .cse7) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse5))) 0))) (not (<= v_thread2Thread1of1ForFork0_~i~1_496 0)))) (= c_thread1Thread1of1ForFork2_~i~0 0) (not (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| c_~A~0.base))) is different from false [2022-04-18 20:28:52,135 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_thread2Thread1of1ForFork0_~i~1_496 Int)) (or (and (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse0) 0) (+ c_~A~0.offset .cse0 3) 0) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse0))) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset 2 .cse3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse2 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset 2 .cse4) 0) (+ c_~A~0.offset 3 .cse4) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse2))) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset .cse5 3) 0) (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset 2 .cse6) 0) (+ c_~A~0.offset 3 .cse6) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse5 1))) 0))) (not (<= v_thread2Thread1of1ForFork0_~i~1_496 0)))) (not (= c_~C~0.base c_~A~0.base)) (= c_thread1Thread1of1ForFork2_~i~0 0)) is different from false [2022-04-18 20:28:53,300 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#race| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork0_~i~1_496 Int)) (or (and (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset 2 .cse0))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0 1) 0) .cse1 0) (+ c_~A~0.offset .cse0 3) 0) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset 3 .cse2) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse1))) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset 2 .cse4) 0) (+ c_~A~0.offset 3 .cse4) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse3))) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (+ c_~A~0.offset .cse6 1))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse5 0) (+ c_~A~0.offset 2 .cse6) 0) (+ c_~A~0.offset .cse6 3) 0) (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset 2 .cse7) 0) (+ c_~A~0.offset 3 .cse7) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse5))) 0))) (not (<= v_thread2Thread1of1ForFork0_~i~1_496 0)))) (<= 1 c_thread1Thread1of1ForFork2_~i~0)) is different from false [2022-04-18 20:28:54,380 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#race| c_~A~0.base)) (.cse8 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_496 Int)) (or (and (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse0) 0) (+ c_~A~0.offset .cse0 3) 0) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse0))) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset 2 .cse3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse2 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset 2 .cse4) 0) (+ c_~A~0.offset 3 .cse4) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse2))) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset .cse5 3) 0) (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset 2 .cse6) 0) (+ c_~A~0.offset 3 .cse6) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse5 1))) 0))) (not (<= v_thread2Thread1of1ForFork0_~i~1_496 0)))) (= (select .cse7 (+ c_~A~0.offset .cse8)) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse7 (+ c_~A~0.offset .cse8 1)) 0) (<= 1 c_thread1Thread1of1ForFork2_~i~0))) is different from false [2022-04-18 20:28:55,508 WARN L833 $PredicateComparison]: unable to prove that (and (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork0_~i~1_496 Int)) (or (and (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset 2 .cse0))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0 1) 0) .cse1 0) (+ c_~A~0.offset .cse0 3) 0) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset 3 .cse2) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse1))) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset 2 .cse4) 0) (+ c_~A~0.offset 3 .cse4) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse3))) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (+ c_~A~0.offset .cse6 1))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse5 0) (+ c_~A~0.offset 2 .cse6) 0) (+ c_~A~0.offset .cse6 3) 0) (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset 2 .cse7) 0) (+ c_~A~0.offset 3 .cse7) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse5))) 0))) (not (<= v_thread2Thread1of1ForFork0_~i~1_496 0))))) is different from false [2022-04-18 20:28:56,824 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_thread2Thread1of1ForFork0_~i~1_496 Int)) (or (and (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse0) 0) (+ c_~A~0.offset .cse0 3) 0) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse0))) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset 2 .cse3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse2 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset 2 .cse4) 0) (+ c_~A~0.offset 3 .cse4) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse2))) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_496 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset .cse5 3) 0) (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset 2 .cse6) 0) (+ c_~A~0.offset 3 .cse6) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse5 1))) 0))) (not (<= v_thread2Thread1of1ForFork0_~i~1_496 0)))) (not (= c_~C~0.base c_~A~0.base))) is different from false [2022-04-18 20:29:01,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:29:01,692 INFO L93 Difference]: Finished difference Result 40413 states and 162778 transitions. [2022-04-18 20:29:01,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-18 20:29:01,693 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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 28 [2022-04-18 20:29:01,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:29:01,811 INFO L225 Difference]: With dead ends: 40413 [2022-04-18 20:29:01,811 INFO L226 Difference]: Without dead ends: 40376 [2022-04-18 20:29:01,811 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=162, Invalid=502, Unknown=22, NotChecked=504, Total=1190 [2022-04-18 20:29:01,812 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 457 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1518 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:29:01,812 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [457 Valid, 432 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1169 Invalid, 0 Unknown, 1518 Unchecked, 1.2s Time] [2022-04-18 20:29:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40376 states. [2022-04-18 20:29:02,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40376 to 21993. [2022-04-18 20:29:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21993 states, 21991 states have (on average 4.083852485107544) internal successors, (89808), 21992 states have internal predecessors, (89808), 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 20:29:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21993 states to 21993 states and 89808 transitions. [2022-04-18 20:29:02,799 INFO L78 Accepts]: Start accepts. Automaton has 21993 states and 89808 transitions. Word has length 28 [2022-04-18 20:29:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:29:02,799 INFO L478 AbstractCegarLoop]: Abstraction has 21993 states and 89808 transitions. [2022-04-18 20:29:02,799 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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 20:29:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 21993 states and 89808 transitions. [2022-04-18 20:29:02,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-18 20:29:02,819 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:29:02,819 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:29:02,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-18 20:29:03,036 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,SelfDestructingSolverStorable20 [2022-04-18 20:29:03,040 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:29:03,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:29:03,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1639771223, now seen corresponding path program 1 times [2022-04-18 20:29:03,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:29:03,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790133930] [2022-04-18 20:29:03,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:29:03,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:29:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:29:03,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:29:03,124 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:29:03,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790133930] [2022-04-18 20:29:03,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790133930] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:29:03,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452764673] [2022-04-18 20:29:03,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:29:03,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:29:03,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:29:03,140 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 20:29:03,196 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 20:29:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:29:03,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-18 20:29:03,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:29:03,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:29:03,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:29:03,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:29:03,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452764673] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-18 20:29:03,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-18 20:29:03,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-04-18 20:29:03,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433948561] [2022-04-18 20:29:03,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:29:03,516 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 20:29:03,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:29:03,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 20:29:03,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:29:03,517 INFO L87 Difference]: Start difference. First operand 21993 states and 89808 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:29:03,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:29:03,726 INFO L93 Difference]: Finished difference Result 22291 states and 90882 transitions. [2022-04-18 20:29:03,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-18 20:29:03,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-04-18 20:29:03,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:29:03,900 INFO L225 Difference]: With dead ends: 22291 [2022-04-18 20:29:03,901 INFO L226 Difference]: Without dead ends: 22291 [2022-04-18 20:29:03,901 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:29:03,902 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 71 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:29:03,902 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 40 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-18 20:29:03,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22291 states. [2022-04-18 20:29:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22291 to 22291. [2022-04-18 20:29:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22291 states, 22289 states have (on average 4.077437300910763) internal successors, (90882), 22290 states have internal predecessors, (90882), 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 20:29:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22291 states to 22291 states and 90882 transitions. [2022-04-18 20:29:04,381 INFO L78 Accepts]: Start accepts. Automaton has 22291 states and 90882 transitions. Word has length 29 [2022-04-18 20:29:04,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:29:04,381 INFO L478 AbstractCegarLoop]: Abstraction has 22291 states and 90882 transitions. [2022-04-18 20:29:04,381 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:29:04,381 INFO L276 IsEmpty]: Start isEmpty. Operand 22291 states and 90882 transitions. [2022-04-18 20:29:04,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-18 20:29:04,391 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:29:04,391 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:29:04,408 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 20:29:04,608 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,SelfDestructingSolverStorable21 [2022-04-18 20:29:04,608 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:29:04,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:29:04,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1981371180, now seen corresponding path program 1 times [2022-04-18 20:29:04,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:29:04,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244961136] [2022-04-18 20:29:04,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:29:04,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:29:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:29:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:29:04,957 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:29:04,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244961136] [2022-04-18 20:29:04,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244961136] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:29:04,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428969876] [2022-04-18 20:29:04,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:29:04,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:29:04,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:29:04,959 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 20:29:04,960 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 20:29:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:29:05,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-18 20:29:05,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:29:05,199 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:29:05,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-04-18 20:29:05,220 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 20:29:05,220 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 11 treesize of output 11 [2022-04-18 20:29:05,284 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 15 treesize of output 11 [2022-04-18 20:29:05,309 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-18 20:29:05,309 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 28 treesize of output 27 [2022-04-18 20:29:05,375 INFO L356 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-04-18 20:29:05,375 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 40 treesize of output 42 [2022-04-18 20:29:05,433 INFO L356 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-04-18 20:29:05,433 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 52 treesize of output 57 [2022-04-18 20:29:05,641 INFO L356 Elim1Store]: treesize reduction 1318, result has 5.9 percent of original size [2022-04-18 20:29:05,641 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 5 new quantified variables, introduced 13 case distinctions, treesize of input 90 treesize of output 113 [2022-04-18 20:29:05,646 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 101 treesize of output 89 [2022-04-18 20:29:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:29:09,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:29:09,750 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2828 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse0 c_~A~0.offset) 0) (+ .cse0 c_~A~0.offset 1) 0) (+ .cse0 c_~A~0.offset 2) 0) (+ .cse0 c_~A~0.offset 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 3)) 0)) (forall ((v_ArrVal_2828 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse1 c_~A~0.offset) 0) (+ .cse1 c_~A~0.offset 1) 0) (+ .cse1 c_~A~0.offset 2) 0) (+ .cse1 c_~A~0.offset 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_2828 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse2 c_~A~0.offset) 0) (+ .cse2 c_~A~0.offset 1) 0) (+ .cse2 c_~A~0.offset 2) 0) (+ .cse2 c_~A~0.offset 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (forall ((v_ArrVal_2828 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse3 c_~A~0.offset) 0) (+ .cse3 c_~A~0.offset 1) 0) (+ .cse3 c_~A~0.offset 2) 0) (+ .cse3 c_~A~0.offset 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 1))))) is different from false [2022-04-18 20:29:10,021 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse0) 0) (+ c_~A~0.offset .cse0 3) 0) (+ .cse1 c_~A~0.offset) 0) (+ .cse1 c_~A~0.offset 1) 0) (+ .cse1 c_~A~0.offset 2) 0) (+ .cse1 c_~A~0.offset 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) (+ c_~A~0.offset .cse0))) 0)) (forall ((v_ArrVal_2828 (Array Int Int))) (= 0 (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset 2 .cse3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse2 0) (+ c_~A~0.offset .cse3 3) 0) (+ .cse4 c_~A~0.offset) 0) (+ .cse4 c_~A~0.offset 1) 0) (+ .cse4 c_~A~0.offset 2) 0) (+ .cse4 c_~A~0.offset 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) .cse2))))) (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset .cse5 3) 0) (+ .cse6 c_~A~0.offset) 0) (+ .cse6 c_~A~0.offset 1) 0) (+ .cse6 c_~A~0.offset 2) 0) (+ .cse6 c_~A~0.offset 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) (+ c_~A~0.offset .cse5 1))) 0))) is different from false [2022-04-18 20:29:12,086 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_thread2Thread1of1ForFork0_~i~1_500 Int)) (or (and (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse0) 0) (+ c_~A~0.offset .cse0 3) 0) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) (+ c_~A~0.offset .cse0 1))) 0)) (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset 2 .cse3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse2 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) .cse2))) 0)) (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset .cse5 3) 0) (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) (+ c_~A~0.offset .cse5))) 0))) (not (<= v_thread2Thread1of1ForFork0_~i~1_500 0)))) is different from false [2022-04-18 20:29:12,176 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_thread2Thread1of1ForFork0_~i~1_500 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_500 0)) (and (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (+ c_~A~0.offset .cse1 1))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse0 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset .cse1 3) 0) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) .cse0))) 0)) (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) (+ c_~A~0.offset .cse3))) 0)) (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse6 (+ c_~A~0.offset 2 .cse5))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse5 1) 0) .cse6 0) (+ c_~A~0.offset .cse5 3) 0) (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) .cse6))) 0))))) is different from false [2022-04-18 20:29:12,424 INFO L356 Elim1Store]: treesize reduction 1871, result has 5.2 percent of original size [2022-04-18 20:29:12,425 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 8 case distinctions, treesize of input 82 treesize of output 118 [2022-04-18 20:29:12,430 INFO L356 Elim1Store]: treesize reduction 490, result has 0.2 percent of original size [2022-04-18 20:29:12,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 55 [2022-04-18 20:29:12,433 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 10 treesize of output 3 [2022-04-18 20:29:12,501 INFO L356 Elim1Store]: treesize reduction 1973, result has 0.1 percent of original size [2022-04-18 20:29:12,501 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 8 case distinctions, treesize of input 82 treesize of output 1 [2022-04-18 20:29:12,557 INFO L356 Elim1Store]: treesize reduction 1973, result has 0.1 percent of original size [2022-04-18 20:29:12,557 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 8 case distinctions, treesize of input 81 treesize of output 1 [2022-04-18 20:29:12,597 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2022-04-18 20:29:12,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428969876] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:29:12,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1045381388] [2022-04-18 20:29:12,597 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 20:29:12,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:29:12,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 22 [2022-04-18 20:29:12,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513532848] [2022-04-18 20:29:12,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:29:12,598 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-18 20:29:12,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:29:12,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-18 20:29:12,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=288, Unknown=12, NotChecked=156, Total=552 [2022-04-18 20:29:12,598 INFO L87 Difference]: Start difference. First operand 22291 states and 90882 transitions. Second operand has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:29:13,748 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (forall ((v_thread2Thread1of1ForFork0_~i~1_500 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_500 0)) (and (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (+ c_~A~0.offset .cse1 1))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse0 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset .cse1 3) 0) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) .cse0))) 0)) (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) (+ c_~A~0.offset .cse3))) 0)) (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse6 (+ c_~A~0.offset 2 .cse5))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse5 1) 0) .cse6 0) (+ c_~A~0.offset .cse5 3) 0) (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) .cse6))) 0))))) (not (= c_~C~0.base c_~A~0.base)) (= c_thread1Thread1of1ForFork2_~i~0 0) (not (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| c_~A~0.base))) is different from false [2022-04-18 20:29:14,749 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_thread2Thread1of1ForFork0_~i~1_500 Int)) (or (and (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse0) 0) (+ c_~A~0.offset .cse0 3) 0) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) (+ c_~A~0.offset .cse0 1))) 0)) (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset 2 .cse3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse2 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) .cse2))) 0)) (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset .cse5 3) 0) (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) (+ c_~A~0.offset .cse5))) 0))) (not (<= v_thread2Thread1of1ForFork0_~i~1_500 0)))) (not (= c_~C~0.base c_~A~0.base)) (= c_thread1Thread1of1ForFork2_~i~0 0)) is different from false [2022-04-18 20:29:16,171 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_thread2Thread1of1ForFork0_~i~1_500 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_500 0)) (and (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (+ c_~A~0.offset .cse1 1))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse0 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset .cse1 3) 0) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) .cse0))) 0)) (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) (+ c_~A~0.offset .cse3))) 0)) (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse6 (+ c_~A~0.offset 2 .cse5))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse5 1) 0) .cse6 0) (+ c_~A~0.offset .cse5 3) 0) (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) .cse6))) 0))))) (= (select (select |c_#race| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0) (not (= c_~C~0.base c_~A~0.base)) (<= 1 c_thread1Thread1of1ForFork2_~i~0)) is different from false [2022-04-18 20:29:17,163 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#race| c_~A~0.base)) (.cse8 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_500 Int)) (or (and (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse0) 0) (+ c_~A~0.offset .cse0 3) 0) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) (+ c_~A~0.offset .cse0 1))) 0)) (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset 2 .cse3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse2 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) .cse2))) 0)) (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset .cse5 3) 0) (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) (+ c_~A~0.offset .cse5))) 0))) (not (<= v_thread2Thread1of1ForFork0_~i~1_500 0)))) (= (select .cse7 (+ c_~A~0.offset .cse8)) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse7 (+ c_~A~0.offset .cse8 1)) 0) (<= 1 c_thread1Thread1of1ForFork2_~i~0))) is different from false [2022-04-18 20:29:18,428 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_thread2Thread1of1ForFork0_~i~1_500 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_500 0)) (and (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (+ c_~A~0.offset .cse1 1))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse0 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset .cse1 3) 0) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) .cse0))) 0)) (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) (+ c_~A~0.offset .cse3))) 0)) (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse6 (+ c_~A~0.offset 2 .cse5))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse5 1) 0) .cse6 0) (+ c_~A~0.offset .cse5 3) 0) (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) .cse6))) 0))))) (not (= c_~C~0.base c_~A~0.base))) is different from false [2022-04-18 20:29:19,700 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_thread2Thread1of1ForFork0_~i~1_500 Int)) (or (and (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse0) 0) (+ c_~A~0.offset .cse0 3) 0) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) (+ c_~A~0.offset .cse0 1))) 0)) (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset 2 .cse3))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse2 0) (+ c_~A~0.offset .cse3 3) 0) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) .cse2))) 0)) (forall ((v_ArrVal_2828 (Array Int Int))) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_500 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset .cse5 3) 0) (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_2828) c_~A~0.base) (+ c_~A~0.offset .cse5))) 0))) (not (<= v_thread2Thread1of1ForFork0_~i~1_500 0)))) (not (= c_~C~0.base c_~A~0.base))) is different from false [2022-04-18 20:29:24,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:29:24,549 INFO L93 Difference]: Finished difference Result 48728 states and 198086 transitions. [2022-04-18 20:29:24,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-18 20:29:24,549 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-04-18 20:29:24,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:29:24,859 INFO L225 Difference]: With dead ends: 48728 [2022-04-18 20:29:24,859 INFO L226 Difference]: Without dead ends: 48691 [2022-04-18 20:29:24,863 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=177, Invalid=545, Unknown=20, NotChecked=590, Total=1332 [2022-04-18 20:29:24,864 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 434 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 2634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1721 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-18 20:29:24,864 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 375 Invalid, 2634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 858 Invalid, 0 Unknown, 1721 Unchecked, 0.9s Time] [2022-04-18 20:29:24,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48691 states. [2022-04-18 20:29:25,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48691 to 25736. [2022-04-18 20:29:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25736 states, 25734 states have (on average 4.0818761171990365) internal successors, (105043), 25735 states have internal predecessors, (105043), 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 20:29:25,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25736 states to 25736 states and 105043 transitions. [2022-04-18 20:29:25,904 INFO L78 Accepts]: Start accepts. Automaton has 25736 states and 105043 transitions. Word has length 29 [2022-04-18 20:29:25,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:29:25,904 INFO L478 AbstractCegarLoop]: Abstraction has 25736 states and 105043 transitions. [2022-04-18 20:29:25,904 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:29:25,904 INFO L276 IsEmpty]: Start isEmpty. Operand 25736 states and 105043 transitions. [2022-04-18 20:29:25,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-18 20:29:25,935 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:29:25,935 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:29:25,953 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 20:29:26,151 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,SelfDestructingSolverStorable22 [2022-04-18 20:29:26,151 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:29:26,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:29:26,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1994573460, now seen corresponding path program 2 times [2022-04-18 20:29:26,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:29:26,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199382626] [2022-04-18 20:29:26,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:29:26,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:29:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:29:26,362 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:29:26,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:29:26,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199382626] [2022-04-18 20:29:26,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199382626] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:29:26,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545592808] [2022-04-18 20:29:26,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:29:26,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:29:26,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:29:26,364 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 20:29:26,365 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 20:29:26,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:29:26,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:29:26,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-18 20:29:26,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:29:26,591 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:29:26,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-04-18 20:29:26,630 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 20:29:26,630 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 11 treesize of output 11 [2022-04-18 20:29:26,818 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 15 treesize of output 11 [2022-04-18 20:29:26,861 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-18 20:29:26,861 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 28 treesize of output 27 [2022-04-18 20:29:26,936 INFO L356 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-04-18 20:29:26,936 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 40 treesize of output 42 [2022-04-18 20:29:26,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:26,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:26,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:26,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:26,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:26,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:27,044 INFO L356 Elim1Store]: treesize reduction 613, result has 5.5 percent of original size [2022-04-18 20:29:27,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 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 85 [2022-04-18 20:29:27,048 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 76 treesize of output 66 [2022-04-18 20:29:27,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:27,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:27,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:27,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:27,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:27,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:27,184 INFO L356 Elim1Store]: treesize reduction 464, result has 13.1 percent of original size [2022-04-18 20:29:27,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 86 treesize of output 103 [2022-04-18 20:29:27,240 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-18 20:29:27,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:29:27,517 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3010 (Array Int Int))) (= (let ((.cse0 (+ c_~A~0.offset 2 (* c_thread1Thread1of1ForFork2_~i~0 4)))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse0 0) (+ .cse1 c_~A~0.offset) 0) (+ .cse1 c_~A~0.offset 1) 0) (+ .cse1 c_~A~0.offset 2) 0) (+ .cse1 c_~A~0.offset 3) 0))) c_~C~0.base v_ArrVal_3010) c_~A~0.base) .cse0)) 0)) (forall ((v_ArrVal_3010 (Array Int Int))) (= (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse2) 0) (+ .cse3 c_~A~0.offset) 0) (+ .cse3 c_~A~0.offset 1) 0) (+ .cse3 c_~A~0.offset 2) 0) (+ .cse3 c_~A~0.offset 3) 0))) c_~C~0.base v_ArrVal_3010) c_~A~0.base) (+ c_~A~0.offset .cse2))) 0)) (forall ((v_ArrVal_3010 (Array Int Int))) (= (let ((.cse4 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse4) 0) (+ .cse5 c_~A~0.offset) 0) (+ .cse5 c_~A~0.offset 1) 0) (+ .cse5 c_~A~0.offset 2) 0) (+ .cse5 c_~A~0.offset 3) 0))) c_~C~0.base v_ArrVal_3010) c_~A~0.base) (+ c_~A~0.offset .cse4 1))) 0))) is different from false [2022-04-18 20:29:28,173 INFO L356 Elim1Store]: treesize reduction 1006, result has 7.1 percent of original size [2022-04-18 20:29:28,174 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 60 treesize of output 91 [2022-04-18 20:29:28,182 INFO L356 Elim1Store]: treesize reduction 288, result has 0.3 percent of original size [2022-04-18 20:29:28,182 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 106 treesize of output 50 [2022-04-18 20:29:28,185 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 9 treesize of output 3 [2022-04-18 20:29:28,222 INFO L356 Elim1Store]: treesize reduction 1082, result has 0.1 percent of original size [2022-04-18 20:29:28,222 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 61 treesize of output 1 [2022-04-18 20:29:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-04-18 20:29:28,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545592808] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:29:28,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1340078772] [2022-04-18 20:29:28,278 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 20:29:28,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:29:28,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2022-04-18 20:29:28,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140412869] [2022-04-18 20:29:28,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:29:28,279 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-18 20:29:28,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:29:28,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-18 20:29:28,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=474, Unknown=26, NotChecked=46, Total=650 [2022-04-18 20:29:28,280 INFO L87 Difference]: Start difference. First operand 25736 states and 105043 transitions. Second operand has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 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 20:29:32,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-18 20:29:32,040 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=674, Invalid=1848, Unknown=32, NotChecked=98, Total=2652 [2022-04-18 20:29:32,040 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 314 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 848 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-18 20:29:32,041 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 545 Invalid, 2411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1488 Invalid, 0 Unknown, 848 Unchecked, 1.4s Time] [2022-04-18 20:29:32,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-18 20:29:32,257 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,SelfDestructingSolverStorable23 [2022-04-18 20:29:32,257 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at most one deprecated predicate at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:973) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:853) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:770) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:470) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:421) 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 20:29:32,258 INFO L158 Benchmark]: Toolchain (without parser) took 424360.88ms. Allocated memory was 107.0MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 79.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 968.7MB. Max. memory is 16.1GB. [2022-04-18 20:29:32,259 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 107.0MB. Free memory was 61.9MB in the beginning and 61.9MB in the end (delta: 49.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 20:29:32,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.13ms. Allocated memory is still 107.0MB. Free memory was 78.8MB in the beginning and 80.3MB in the end (delta: -1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-04-18 20:29:32,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.96ms. Allocated memory is still 107.0MB. Free memory was 80.3MB in the beginning and 77.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 20:29:32,259 INFO L158 Benchmark]: Boogie Preprocessor took 59.70ms. Allocated memory is still 107.0MB. Free memory was 77.9MB in the beginning and 75.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 20:29:32,259 INFO L158 Benchmark]: RCFGBuilder took 575.50ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 75.5MB in the beginning and 94.8MB in the end (delta: -19.2MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2022-04-18 20:29:32,259 INFO L158 Benchmark]: TraceAbstraction took 423389.99ms. Allocated memory was 130.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 94.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 960.5MB. Max. memory is 16.1GB. [2022-04-18 20:29:32,259 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 107.0MB. Free memory was 61.9MB in the beginning and 61.9MB in the end (delta: 49.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.13ms. Allocated memory is still 107.0MB. Free memory was 78.8MB in the beginning and 80.3MB in the end (delta: -1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.96ms. Allocated memory is still 107.0MB. Free memory was 80.3MB in the beginning and 77.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.70ms. Allocated memory is still 107.0MB. Free memory was 77.9MB in the beginning and 75.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 575.50ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 75.5MB in the beginning and 94.8MB in the end (delta: -19.2MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. * TraceAbstraction took 423389.99ms. Allocated memory was 130.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 94.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 960.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 61.3s, 279 PlacesBefore, 84 PlacesAfterwards, 285 TransitionsBefore, 83 TransitionsAfterwards, 6748 CoEnabledTransitionPairs, 9 FixpointIterations, 173 TrivialSequentialCompositions, 95 ConcurrentSequentialCompositions, 20 TrivialYvCompositions, 8 ConcurrentYvCompositions, 7 ChoiceCompositions, 303 TotalNumberOfCompositions, 29769 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16502, positive: 15921, positive conditional: 0, positive unconditional: 15921, negative: 581, negative conditional: 0, negative unconditional: 581, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5453, positive: 5339, positive conditional: 0, positive unconditional: 5339, negative: 114, negative conditional: 0, negative unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5453, positive: 4674, positive conditional: 0, positive unconditional: 4674, negative: 779, negative conditional: 0, negative unconditional: 779, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 779, positive: 665, positive conditional: 0, positive unconditional: 665, negative: 90, negative conditional: 0, negative unconditional: 90, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , SemanticIndependenceRelation.Query Time [ms]: [ total: 53100, positive: 677, positive conditional: 0, positive unconditional: 677, negative: 1435, negative conditional: 0, negative unconditional: 1435, unknown: 50988, unknown conditional: 0, unknown unconditional: 50988] ], Cache Queries: [ total: 16502, positive: 10582, positive conditional: 0, positive unconditional: 10582, negative: 467, negative conditional: 0, negative unconditional: 467, unknown: 5453, unknown conditional: 0, unknown unconditional: 5453] , Statistics on independence cache: Total cache size (in pairs): 1299, Positive cache size: 1246, Positive conditional cache size: 0, Positive unconditional cache size: 1246, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53 - ExceptionOrErrorResult: AssertionError: at most one deprecated predicate de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at most one deprecated predicate: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:973) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-18 20:29:32,470 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-04-18 20:29:32,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/weaver/popl20-simple-array-sum.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-DataRace-32bit-Taipan_Bitvector.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 eecffe8522a4364afb75ce7fb01800caae42a8a3ed11b56f212b94255e6f04bc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 20:29:34,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 20:29:34,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 20:29:34,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 20:29:34,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 20:29:34,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 20:29:34,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 20:29:34,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 20:29:34,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 20:29:34,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 20:29:34,134 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 20:29:34,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 20:29:34,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 20:29:34,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 20:29:34,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 20:29:34,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 20:29:34,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 20:29:34,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 20:29:34,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 20:29:34,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 20:29:34,162 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 20:29:34,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 20:29:34,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 20:29:34,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 20:29:34,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 20:29:34,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 20:29:34,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 20:29:34,168 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 20:29:34,169 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 20:29:34,169 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 20:29:34,170 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 20:29:34,170 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 20:29:34,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 20:29:34,172 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 20:29:34,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 20:29:34,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 20:29:34,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 20:29:34,174 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 20:29:34,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 20:29:34,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 20:29:34,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 20:29:34,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 20:29:34,178 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-DataRace-32bit-Taipan_Bitvector.epf [2022-04-18 20:29:34,197 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 20:29:34,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 20:29:34,198 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 20:29:34,198 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 20:29:34,198 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 20:29:34,198 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 20:29:34,198 INFO L138 SettingsManager]: * User list type=DISABLED [2022-04-18 20:29:34,199 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-04-18 20:29:34,199 INFO L138 SettingsManager]: * Explicit value domain=true [2022-04-18 20:29:34,199 INFO L138 SettingsManager]: * Octagon Domain=false [2022-04-18 20:29:34,200 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-04-18 20:29:34,200 INFO L138 SettingsManager]: * Interval Domain=false [2022-04-18 20:29:34,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 20:29:34,200 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 20:29:34,200 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 20:29:34,201 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 20:29:34,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 20:29:34,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 20:29:34,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 20:29:34,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 20:29:34,201 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 20:29:34,201 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-04-18 20:29:34,201 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-04-18 20:29:34,202 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 20:29:34,202 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 20:29:34,202 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 20:29:34,202 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 20:29:34,202 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 20:29:34,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-18 20:29:34,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 20:29:34,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 20:29:34,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 20:29:34,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 20:29:34,203 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 20:29:34,203 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-04-18 20:29:34,203 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-04-18 20:29:34,204 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 20:29:34,204 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-18 20:29:34,204 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-18 20:29:34,204 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> eecffe8522a4364afb75ce7fb01800caae42a8a3ed11b56f212b94255e6f04bc [2022-04-18 20:29:34,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 20:29:34,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 20:29:34,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 20:29:34,495 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 20:29:34,496 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 20:29:34,496 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2022-04-18 20:29:34,536 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7e43ed0ec/e294b4a2d6a74a4b8af728a6a703374a/FLAG720001c8b [2022-04-18 20:29:34,926 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 20:29:34,929 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2022-04-18 20:29:34,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7e43ed0ec/e294b4a2d6a74a4b8af728a6a703374a/FLAG720001c8b [2022-04-18 20:29:34,958 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7e43ed0ec/e294b4a2d6a74a4b8af728a6a703374a [2022-04-18 20:29:34,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 20:29:34,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 20:29:34,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 20:29:34,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 20:29:34,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 20:29:34,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 08:29:34" (1/1) ... [2022-04-18 20:29:34,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e6996d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:29:34, skipping insertion in model container [2022-04-18 20:29:34,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 08:29:34" (1/1) ... [2022-04-18 20:29:34,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 20:29:34,988 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 20:29:35,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/weaver/popl20-simple-array-sum.wvr.c[2690,2703] [2022-04-18 20:29:35,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 20:29:35,204 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 20:29:35,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c[2690,2703] [2022-04-18 20:29:35,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 20:29:35,257 INFO L208 MainTranslator]: Completed translation [2022-04-18 20:29:35,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:29:35 WrapperNode [2022-04-18 20:29:35,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 20:29:35,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 20:29:35,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 20:29:35,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 20:29:35,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:29:35" (1/1) ... [2022-04-18 20:29:35,281 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:29:35" (1/1) ... [2022-04-18 20:29:35,305 INFO L137 Inliner]: procedures = 28, calls = 43, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 171 [2022-04-18 20:29:35,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 20:29:35,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 20:29:35,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 20:29:35,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 20:29:35,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:29:35" (1/1) ... [2022-04-18 20:29:35,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:29:35" (1/1) ... [2022-04-18 20:29:35,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:29:35" (1/1) ... [2022-04-18 20:29:35,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:29:35" (1/1) ... [2022-04-18 20:29:35,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:29:35" (1/1) ... [2022-04-18 20:29:35,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:29:35" (1/1) ... [2022-04-18 20:29:35,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:29:35" (1/1) ... [2022-04-18 20:29:35,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 20:29:35,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 20:29:35,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 20:29:35,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 20:29:35,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:29:35" (1/1) ... [2022-04-18 20:29:35,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 20:29:35,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:29:35,379 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 20:29:35,383 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 20:29:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 20:29:35,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-04-18 20:29:35,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 20:29:35,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-04-18 20:29:35,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-04-18 20:29:35,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-04-18 20:29:35,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-04-18 20:29:35,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-04-18 20:29:35,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-04-18 20:29:35,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-04-18 20:29:35,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-04-18 20:29:35,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-04-18 20:29:35,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-18 20:29:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 20:29:35,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 20:29:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 20:29:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-04-18 20:29:35,420 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-04-18 20:29:35,530 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 20:29:35,531 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 20:29:35,936 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 20:29:36,060 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 20:29:36,060 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-18 20:29:36,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 08:29:36 BoogieIcfgContainer [2022-04-18 20:29:36,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 20:29:36,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 20:29:36,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 20:29:36,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 20:29:36,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 08:29:34" (1/3) ... [2022-04-18 20:29:36,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a00f21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 08:29:36, skipping insertion in model container [2022-04-18 20:29:36,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:29:35" (2/3) ... [2022-04-18 20:29:36,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a00f21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 08:29:36, skipping insertion in model container [2022-04-18 20:29:36,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 08:29:36" (3/3) ... [2022-04-18 20:29:36,070 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2022-04-18 20:29:36,073 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 20:29:36,073 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 20:29:36,074 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-04-18 20:29:36,074 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 20:29:36,123 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-04-18 20:29:36,154 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 20:29:36,160 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 20:29:36,160 INFO L341 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-04-18 20:29:36,172 INFO L116 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-04-18 20:29:36,179 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 278 places, 284 transitions, 592 flow [2022-04-18 20:29:36,180 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 278 places, 284 transitions, 592 flow [2022-04-18 20:29:36,182 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 278 places, 284 transitions, 592 flow [2022-04-18 20:29:36,237 INFO L129 PetriNetUnfolder]: 16/281 cut-off events. [2022-04-18 20:29:36,238 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-04-18 20:29:36,244 INFO L84 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 281 events. 16/281 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 351 event pairs, 0 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 206. Up to 3 conditions per place. [2022-04-18 20:29:36,248 INFO L116 LiptonReduction]: Number of co-enabled transitions 6748 [2022-04-18 20:30:47,055 INFO L131 LiptonReduction]: Checked pairs total: 31087 [2022-04-18 20:30:47,055 INFO L133 LiptonReduction]: Total number of compositions: 317 [2022-04-18 20:30:47,060 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 83 transitions, 190 flow [2022-04-18 20:30:47,580 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14904 states, 14251 states have (on average 4.31317100554347) internal successors, (61467), 14903 states have internal predecessors, (61467), 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 20:30:47,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 14904 states, 14251 states have (on average 4.31317100554347) internal successors, (61467), 14903 states have internal predecessors, (61467), 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 20:30:47,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-04-18 20:30:47,673 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:30:47,674 INFO L499 BasicCegarLoop]: trace histogram [1] [2022-04-18 20:30:47,675 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:30:47,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:30:47,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1144, now seen corresponding path program 1 times [2022-04-18 20:30:47,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:30:47,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633342675] [2022-04-18 20:30:47,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:30:47,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:30:47,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:30:47,688 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:30:47,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-04-18 20:30:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:30:47,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-18 20:30:47,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:30:47,743 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 20:30:47,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:30:47,743 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:30:47,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633342675] [2022-04-18 20:30:47,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633342675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:30:47,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:30:47,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-04-18 20:30:47,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789592544] [2022-04-18 20:30:47,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:30:47,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-18 20:30:47,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:30:47,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-18 20:30:47,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 20:30:47,790 INFO L87 Difference]: Start difference. First operand has 14904 states, 14251 states have (on average 4.31317100554347) internal successors, (61467), 14903 states have internal predecessors, (61467), 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 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 20:30:48,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:30:48,019 INFO L93 Difference]: Finished difference Result 2335 states and 9159 transitions. [2022-04-18 20:30:48,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 20:30:48,021 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-04-18 20:30:48,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:30:48,065 INFO L225 Difference]: With dead ends: 2335 [2022-04-18 20:30:48,066 INFO L226 Difference]: Without dead ends: 2299 [2022-04-18 20:30:48,066 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 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 20:30:48,070 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:30:48,071 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-18 20:30:48,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2022-04-18 20:30:48,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2299. [2022-04-18 20:30:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2299 states, 2295 states have (on average 3.9459694989106753) internal successors, (9056), 2298 states have internal predecessors, (9056), 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 20:30:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 9056 transitions. [2022-04-18 20:30:48,316 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 9056 transitions. Word has length 1 [2022-04-18 20:30:48,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:30:48,317 INFO L478 AbstractCegarLoop]: Abstraction has 2299 states and 9056 transitions. [2022-04-18 20:30:48,317 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 20:30:48,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 9056 transitions. [2022-04-18 20:30:48,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-18 20:30:48,320 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:30:48,321 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:30:48,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-04-18 20:30:48,526 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:30:48,527 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:30:48,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:30:48,527 INFO L85 PathProgramCache]: Analyzing trace with hash -536632665, now seen corresponding path program 1 times [2022-04-18 20:30:48,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:30:48,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671076952] [2022-04-18 20:30:48,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:30:48,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:30:48,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:30:48,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:30:48,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-04-18 20:30:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:30:48,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-18 20:30:48,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:30:48,734 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 20:30:48,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:30:48,734 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:30:48,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671076952] [2022-04-18 20:30:48,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671076952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:30:48,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:30:48,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-18 20:30:48,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198036751] [2022-04-18 20:30:48,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:30:48,736 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 20:30:48,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:30:48,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 20:30:48,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-18 20:30:48,737 INFO L87 Difference]: Start difference. First operand 2299 states and 9056 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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 20:30:49,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:30:49,067 INFO L93 Difference]: Finished difference Result 3326 states and 12806 transitions. [2022-04-18 20:30:49,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-18 20:30:49,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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 12 [2022-04-18 20:30:49,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:30:49,097 INFO L225 Difference]: With dead ends: 3326 [2022-04-18 20:30:49,111 INFO L226 Difference]: Without dead ends: 3326 [2022-04-18 20:30:49,112 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-18 20:30:49,113 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 89 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:30:49,113 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 92 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-18 20:30:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2022-04-18 20:30:49,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 2939. [2022-04-18 20:30:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2939 states, 2935 states have (on average 3.955366269165247) internal successors, (11609), 2938 states have internal predecessors, (11609), 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 20:30:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 11609 transitions. [2022-04-18 20:30:49,248 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 11609 transitions. Word has length 12 [2022-04-18 20:30:49,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:30:49,250 INFO L478 AbstractCegarLoop]: Abstraction has 2939 states and 11609 transitions. [2022-04-18 20:30:49,250 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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 20:30:49,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 11609 transitions. [2022-04-18 20:30:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-18 20:30:49,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:30:49,257 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:30:49,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-04-18 20:30:49,462 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:30:49,463 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:30:49,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:30:49,463 INFO L85 PathProgramCache]: Analyzing trace with hash 831740350, now seen corresponding path program 1 times [2022-04-18 20:30:49,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:30:49,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280431262] [2022-04-18 20:30:49,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:30:49,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:30:49,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:30:49,467 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:30:49,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-04-18 20:30:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:30:49,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-18 20:30:49,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:30:49,595 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 11 treesize of output 7 [2022-04-18 20:30:49,619 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:30:49,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:30:49,673 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:30:49,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:30:49,753 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:30:49,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:30:49,793 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 20:30:49,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:30:49,793 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:30:49,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280431262] [2022-04-18 20:30:49,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280431262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:30:49,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:30:49,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:30:49,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745040831] [2022-04-18 20:30:49,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:30:49,794 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:30:49,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:30:49,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:30:49,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:30:49,795 INFO L87 Difference]: Start difference. First operand 2939 states and 11609 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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 20:30:50,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:30:50,780 INFO L93 Difference]: Finished difference Result 4314 states and 16984 transitions. [2022-04-18 20:30:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:30:50,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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 14 [2022-04-18 20:30:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:30:50,809 INFO L225 Difference]: With dead ends: 4314 [2022-04-18 20:30:50,809 INFO L226 Difference]: Without dead ends: 4314 [2022-04-18 20:30:50,810 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:30:50,810 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 64 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-18 20:30:50,811 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 79 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-18 20:30:50,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4314 states. [2022-04-18 20:30:50,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4314 to 3914. [2022-04-18 20:30:50,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3914 states, 3910 states have (on average 4.0163682864450125) internal successors, (15704), 3913 states have internal predecessors, (15704), 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 20:30:50,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3914 states to 3914 states and 15704 transitions. [2022-04-18 20:30:50,948 INFO L78 Accepts]: Start accepts. Automaton has 3914 states and 15704 transitions. Word has length 14 [2022-04-18 20:30:50,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:30:50,949 INFO L478 AbstractCegarLoop]: Abstraction has 3914 states and 15704 transitions. [2022-04-18 20:30:50,949 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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 20:30:50,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3914 states and 15704 transitions. [2022-04-18 20:30:50,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-18 20:30:50,951 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:30:50,951 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:30:50,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-04-18 20:30:51,157 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:30:51,158 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:30:51,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:30:51,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1899646239, now seen corresponding path program 1 times [2022-04-18 20:30:51,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:30:51,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938181267] [2022-04-18 20:30:51,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:30:51,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:30:51,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:30:51,160 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:30:51,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-04-18 20:30:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:30:51,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-18 20:30:51,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:30:51,265 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 15 treesize of output 11 [2022-04-18 20:30:51,296 INFO L356 Elim1Store]: treesize reduction 36, result has 28.0 percent of original size [2022-04-18 20:30:51,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-04-18 20:30:51,362 INFO L356 Elim1Store]: treesize reduction 90, result has 25.0 percent of original size [2022-04-18 20:30:51,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2022-04-18 20:30:51,461 INFO L356 Elim1Store]: treesize reduction 163, result has 21.6 percent of original size [2022-04-18 20:30:51,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 66 [2022-04-18 20:30:51,516 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 20:30:51,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:30:51,516 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:30:51,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938181267] [2022-04-18 20:30:51,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938181267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:30:51,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:30:51,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:30:51,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14948773] [2022-04-18 20:30:51,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:30:51,517 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:30:51,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:30:51,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:30:51,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:30:51,517 INFO L87 Difference]: Start difference. First operand 3914 states and 15704 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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 20:30:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:30:52,737 INFO L93 Difference]: Finished difference Result 4867 states and 19600 transitions. [2022-04-18 20:30:52,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:30:52,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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 14 [2022-04-18 20:30:52,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:30:52,774 INFO L225 Difference]: With dead ends: 4867 [2022-04-18 20:30:52,775 INFO L226 Difference]: Without dead ends: 4867 [2022-04-18 20:30:52,775 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:30:52,778 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 64 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:30:52,779 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 65 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-18 20:30:52,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4867 states. [2022-04-18 20:30:52,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4867 to 4867. [2022-04-18 20:30:52,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4867 states, 4863 states have (on average 4.030433888546165) internal successors, (19600), 4866 states have internal predecessors, (19600), 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 20:30:53,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4867 states to 4867 states and 19600 transitions. [2022-04-18 20:30:53,013 INFO L78 Accepts]: Start accepts. Automaton has 4867 states and 19600 transitions. Word has length 14 [2022-04-18 20:30:53,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:30:53,014 INFO L478 AbstractCegarLoop]: Abstraction has 4867 states and 19600 transitions. [2022-04-18 20:30:53,014 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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 20:30:53,014 INFO L276 IsEmpty]: Start isEmpty. Operand 4867 states and 19600 transitions. [2022-04-18 20:30:53,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-18 20:30:53,016 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:30:53,016 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:30:53,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-04-18 20:30:53,217 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:30:53,217 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:30:53,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:30:53,217 INFO L85 PathProgramCache]: Analyzing trace with hash 849189331, now seen corresponding path program 1 times [2022-04-18 20:30:53,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:30:53,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721766109] [2022-04-18 20:30:53,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:30:53,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:30:53,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:30:53,219 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:30:53,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-04-18 20:30:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:30:53,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-18 20:30:53,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:30:53,439 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 20:30:53,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:30:53,440 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:30:53,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721766109] [2022-04-18 20:30:53,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721766109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:30:53,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:30:53,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-18 20:30:53,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599399461] [2022-04-18 20:30:53,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:30:53,440 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 20:30:53,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:30:53,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 20:30:53,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-18 20:30:53,441 INFO L87 Difference]: Start difference. First operand 4867 states and 19600 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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 20:30:53,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:30:53,672 INFO L93 Difference]: Finished difference Result 4746 states and 18607 transitions. [2022-04-18 20:30:53,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-18 20:30:53,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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 17 [2022-04-18 20:30:53,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:30:53,691 INFO L225 Difference]: With dead ends: 4746 [2022-04-18 20:30:53,691 INFO L226 Difference]: Without dead ends: 4746 [2022-04-18 20:30:53,691 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-18 20:30:53,692 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 77 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:30:53,692 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 94 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-18 20:30:53,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4746 states. [2022-04-18 20:30:53,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4746 to 4674. [2022-04-18 20:30:53,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4674 states, 4670 states have (on average 3.95203426124197) internal successors, (18456), 4673 states have internal predecessors, (18456), 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 20:30:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4674 states to 4674 states and 18456 transitions. [2022-04-18 20:30:53,926 INFO L78 Accepts]: Start accepts. Automaton has 4674 states and 18456 transitions. Word has length 17 [2022-04-18 20:30:53,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:30:53,926 INFO L478 AbstractCegarLoop]: Abstraction has 4674 states and 18456 transitions. [2022-04-18 20:30:53,927 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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 20:30:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand 4674 states and 18456 transitions. [2022-04-18 20:30:53,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-18 20:30:53,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:30:53,930 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:30:53,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-04-18 20:30:54,138 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:30:54,139 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:30:54,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:30:54,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1641327744, now seen corresponding path program 1 times [2022-04-18 20:30:54,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:30:54,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545527595] [2022-04-18 20:30:54,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:30:54,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:30:54,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:30:54,141 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:30:54,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-04-18 20:30:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:30:54,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-18 20:30:54,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:30:54,337 INFO L356 Elim1Store]: treesize reduction 63, result has 42.2 percent of original size [2022-04-18 20:30:54,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 51 [2022-04-18 20:30:54,380 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 20:30:54,381 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 11 treesize of output 11 [2022-04-18 20:30:54,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:30:54,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:30:54,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:30:54,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:30:54,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:30:54,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:30:54,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 41 [2022-04-18 20:30:54,534 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 41 treesize of output 37 [2022-04-18 20:30:54,563 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 20:30:54,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:30:54,564 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:30:54,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545527595] [2022-04-18 20:30:54,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545527595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:30:54,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:30:54,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-18 20:30:54,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962585584] [2022-04-18 20:30:54,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:30:54,564 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-18 20:30:54,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:30:54,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-18 20:30:54,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-18 20:30:54,565 INFO L87 Difference]: Start difference. First operand 4674 states and 18456 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 20:30:55,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:30:55,288 INFO L93 Difference]: Finished difference Result 13639 states and 54276 transitions. [2022-04-18 20:30:55,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-18 20:30:55,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 20:30:55,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:30:55,457 INFO L225 Difference]: With dead ends: 13639 [2022-04-18 20:30:55,457 INFO L226 Difference]: Without dead ends: 13639 [2022-04-18 20:30:55,458 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2022-04-18 20:30:55,458 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 255 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-18 20:30:55,459 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 99 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-18 20:30:55,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13639 states. [2022-04-18 20:30:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13639 to 6249. [2022-04-18 20:30:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6249 states, 6245 states have (on average 4.0819855884707765) internal successors, (25492), 6248 states have internal predecessors, (25492), 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 20:30:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6249 states to 6249 states and 25492 transitions. [2022-04-18 20:30:55,661 INFO L78 Accepts]: Start accepts. Automaton has 6249 states and 25492 transitions. Word has length 19 [2022-04-18 20:30:55,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:30:55,662 INFO L478 AbstractCegarLoop]: Abstraction has 6249 states and 25492 transitions. [2022-04-18 20:30:55,662 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 20:30:55,662 INFO L276 IsEmpty]: Start isEmpty. Operand 6249 states and 25492 transitions. [2022-04-18 20:30:55,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-18 20:30:55,668 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:30:55,668 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:30:55,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-04-18 20:30:55,874 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:30:55,875 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:30:55,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:30:55,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1860208086, now seen corresponding path program 2 times [2022-04-18 20:30:55,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:30:55,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964211374] [2022-04-18 20:30:55,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 20:30:55,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:30:55,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:30:55,877 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:30:55,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-04-18 20:30:56,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-18 20:30:56,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:30:56,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-18 20:30:56,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:30:56,105 INFO L356 Elim1Store]: treesize reduction 63, result has 42.2 percent of original size [2022-04-18 20:30:56,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 51 [2022-04-18 20:30:56,177 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 20:30:56,177 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 14 treesize of output 14 [2022-04-18 20:30:56,338 INFO L356 Elim1Store]: treesize reduction 157, result has 14.2 percent of original size [2022-04-18 20:30:56,339 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 29 treesize of output 41 [2022-04-18 20:30:56,344 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 41 treesize of output 37 [2022-04-18 20:30:56,385 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 20:30:56,386 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:30:56,386 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:30:56,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964211374] [2022-04-18 20:30:56,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964211374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:30:56,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:30:56,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-18 20:30:56,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994071174] [2022-04-18 20:30:56,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:30:56,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-18 20:30:56,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:30:56,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-18 20:30:56,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-18 20:30:56,387 INFO L87 Difference]: Start difference. First operand 6249 states and 25492 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 20:30:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:30:57,247 INFO L93 Difference]: Finished difference Result 14993 states and 60740 transitions. [2022-04-18 20:30:57,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-18 20:30:57,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 20:30:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:30:57,300 INFO L225 Difference]: With dead ends: 14993 [2022-04-18 20:30:57,300 INFO L226 Difference]: Without dead ends: 14993 [2022-04-18 20:30:57,300 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-04-18 20:30:57,301 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 229 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-18 20:30:57,301 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 113 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-18 20:30:57,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14993 states. [2022-04-18 20:30:57,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14993 to 6323. [2022-04-18 20:30:57,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6323 states, 6319 states have (on average 4.086880835575249) internal successors, (25825), 6322 states have internal predecessors, (25825), 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 20:30:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6323 states to 6323 states and 25825 transitions. [2022-04-18 20:30:57,599 INFO L78 Accepts]: Start accepts. Automaton has 6323 states and 25825 transitions. Word has length 19 [2022-04-18 20:30:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:30:57,599 INFO L478 AbstractCegarLoop]: Abstraction has 6323 states and 25825 transitions. [2022-04-18 20:30:57,599 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 20:30:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 6323 states and 25825 transitions. [2022-04-18 20:30:57,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-18 20:30:57,603 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:30:57,603 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:30:57,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-04-18 20:30:57,816 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:30:57,817 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:30:57,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:30:57,817 INFO L85 PathProgramCache]: Analyzing trace with hash -674842021, now seen corresponding path program 1 times [2022-04-18 20:30:57,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:30:57,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085132514] [2022-04-18 20:30:57,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:30:57,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:30:57,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:30:57,819 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:30:57,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-04-18 20:30:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:30:57,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:30:57,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:30:58,126 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 11 treesize of output 7 [2022-04-18 20:30:58,161 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:30:58,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:30:58,240 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:30:58,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:30:58,323 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:30:58,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:30:58,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:30:58,492 INFO L356 Elim1Store]: treesize reduction 348, result has 9.6 percent of original size [2022-04-18 20:30:58,492 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 5 new quantified variables, introduced 9 case distinctions, treesize of input 77 treesize of output 101 [2022-04-18 20:30:58,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:30:58,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:30:58,535 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:30:58,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 86 [2022-04-18 20:30:58,659 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 20:30:58,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:30:58,660 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:30:58,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085132514] [2022-04-18 20:30:58,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085132514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:30:58,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:30:58,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:30:58,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408787169] [2022-04-18 20:30:58,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:30:58,660 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:30:58,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:30:58,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:30:58,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:30:58,661 INFO L87 Difference]: Start difference. First operand 6323 states and 25825 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 20:30:58,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:30:58,766 INFO L93 Difference]: Finished difference Result 6586 states and 27205 transitions. [2022-04-18 20:30:58,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:30:58,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 20:30:58,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:30:58,782 INFO L225 Difference]: With dead ends: 6586 [2022-04-18 20:30:58,783 INFO L226 Difference]: Without dead ends: 6586 [2022-04-18 20:30:58,783 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:30:58,783 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 32 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:30:58,784 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 209 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 124 Unchecked, 0.0s Time] [2022-04-18 20:30:58,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6586 states. [2022-04-18 20:30:58,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6586 to 6478. [2022-04-18 20:30:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6478 states, 6474 states have (on average 4.118782823602101) internal successors, (26665), 6477 states have internal predecessors, (26665), 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 20:30:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6478 states to 6478 states and 26665 transitions. [2022-04-18 20:30:58,888 INFO L78 Accepts]: Start accepts. Automaton has 6478 states and 26665 transitions. Word has length 19 [2022-04-18 20:30:58,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:30:58,889 INFO L478 AbstractCegarLoop]: Abstraction has 6478 states and 26665 transitions. [2022-04-18 20:30:58,889 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 20:30:58,889 INFO L276 IsEmpty]: Start isEmpty. Operand 6478 states and 26665 transitions. [2022-04-18 20:30:58,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-18 20:30:58,893 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:30:58,893 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:30:58,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-04-18 20:30:59,100 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:30:59,100 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:30:59,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:30:59,101 INFO L85 PathProgramCache]: Analyzing trace with hash -674504431, now seen corresponding path program 2 times [2022-04-18 20:30:59,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:30:59,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129256519] [2022-04-18 20:30:59,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 20:30:59,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:30:59,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:30:59,102 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:30:59,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-04-18 20:30:59,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-18 20:30:59,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:30:59,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-18 20:30:59,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:30:59,367 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 11 treesize of output 7 [2022-04-18 20:30:59,402 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:30:59,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:30:59,469 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:30:59,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:30:59,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:30:59,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:30:59,557 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:30:59,557 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 1 case distinctions, treesize of input 35 treesize of output 39 [2022-04-18 20:30:59,690 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:30:59,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:30:59,784 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 20:30:59,784 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:30:59,784 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:30:59,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129256519] [2022-04-18 20:30:59,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129256519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:30:59,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:30:59,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:30:59,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438464386] [2022-04-18 20:30:59,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:30:59,786 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:30:59,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:30:59,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:30:59,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:30:59,787 INFO L87 Difference]: Start difference. First operand 6478 states and 26665 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 20:30:59,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:30:59,928 INFO L93 Difference]: Finished difference Result 6616 states and 27357 transitions. [2022-04-18 20:30:59,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:30:59,929 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 20:30:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:00,024 INFO L225 Difference]: With dead ends: 6616 [2022-04-18 20:31:00,025 INFO L226 Difference]: Without dead ends: 6616 [2022-04-18 20:31:00,025 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:00,026 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 32 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:00,026 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 199 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 91 Unchecked, 0.1s Time] [2022-04-18 20:31:00,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6616 states. [2022-04-18 20:31:00,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6616 to 6493. [2022-04-18 20:31:00,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6493 states, 6489 states have (on average 4.120973955925412) internal successors, (26741), 6492 states have internal predecessors, (26741), 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 20:31:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6493 states to 6493 states and 26741 transitions. [2022-04-18 20:31:00,146 INFO L78 Accepts]: Start accepts. Automaton has 6493 states and 26741 transitions. Word has length 19 [2022-04-18 20:31:00,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:00,148 INFO L478 AbstractCegarLoop]: Abstraction has 6493 states and 26741 transitions. [2022-04-18 20:31:00,148 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 20:31:00,148 INFO L276 IsEmpty]: Start isEmpty. Operand 6493 states and 26741 transitions. [2022-04-18 20:31:00,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-18 20:31:00,153 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:00,153 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:00,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-04-18 20:31:00,359 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:00,360 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:00,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:00,360 INFO L85 PathProgramCache]: Analyzing trace with hash -660867841, now seen corresponding path program 3 times [2022-04-18 20:31:00,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:00,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419663293] [2022-04-18 20:31:00,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:31:00,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:00,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:00,368 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:00,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-04-18 20:31:00,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:31:00,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:00,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:00,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:00,669 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 11 treesize of output 7 [2022-04-18 20:31:00,740 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:00,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:00,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:00,899 INFO L356 Elim1Store]: treesize reduction 291, result has 11.6 percent of original size [2022-04-18 20:31:00,899 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 78 [2022-04-18 20:31:00,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:00,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:00,934 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:00,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 73 [2022-04-18 20:31:01,025 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:01,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:01,114 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:01,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:01,162 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 20:31:01,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:01,162 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:01,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419663293] [2022-04-18 20:31:01,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419663293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:01,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:01,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:01,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757601444] [2022-04-18 20:31:01,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:01,163 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:01,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:01,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:01,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:01,163 INFO L87 Difference]: Start difference. First operand 6493 states and 26741 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 20:31:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:01,252 INFO L93 Difference]: Finished difference Result 6646 states and 27509 transitions. [2022-04-18 20:31:01,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:01,253 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 20:31:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:01,269 INFO L225 Difference]: With dead ends: 6646 [2022-04-18 20:31:01,269 INFO L226 Difference]: Without dead ends: 6646 [2022-04-18 20:31:01,270 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:01,270 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 44 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:01,270 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 187 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 86 Unchecked, 0.0s Time] [2022-04-18 20:31:01,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6646 states. [2022-04-18 20:31:01,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6646 to 6508. [2022-04-18 20:31:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6508 states, 6504 states have (on average 4.123154981549815) internal successors, (26817), 6507 states have internal predecessors, (26817), 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 20:31:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6508 states to 6508 states and 26817 transitions. [2022-04-18 20:31:01,379 INFO L78 Accepts]: Start accepts. Automaton has 6508 states and 26817 transitions. Word has length 19 [2022-04-18 20:31:01,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:01,379 INFO L478 AbstractCegarLoop]: Abstraction has 6508 states and 26817 transitions. [2022-04-18 20:31:01,379 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 20:31:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 6508 states and 26817 transitions. [2022-04-18 20:31:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-18 20:31:01,384 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:01,384 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:01,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:01,590 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:01,590 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:01,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:01,591 INFO L85 PathProgramCache]: Analyzing trace with hash -339125041, now seen corresponding path program 4 times [2022-04-18 20:31:01,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:01,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538842818] [2022-04-18 20:31:01,591 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:31:01,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:01,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:01,593 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:01,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-04-18 20:31:01,737 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:31:01,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:01,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-18 20:31:01,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:01,898 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 11 treesize of output 7 [2022-04-18 20:31:01,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:01,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:01,953 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:01,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 1 case distinctions, treesize of input 17 treesize of output 25 [2022-04-18 20:31:02,008 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:02,070 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:02,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:02,155 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:02,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:02,209 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 20:31:02,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:02,209 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:02,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538842818] [2022-04-18 20:31:02,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538842818] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:02,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:02,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:02,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654591800] [2022-04-18 20:31:02,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:02,210 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:02,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:02,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:02,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:02,211 INFO L87 Difference]: Start difference. First operand 6508 states and 26817 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 20:31:02,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:02,317 INFO L93 Difference]: Finished difference Result 6676 states and 27661 transitions. [2022-04-18 20:31:02,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:02,319 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 20:31:02,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:02,337 INFO L225 Difference]: With dead ends: 6676 [2022-04-18 20:31:02,337 INFO L226 Difference]: Without dead ends: 6676 [2022-04-18 20:31:02,337 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:02,338 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 44 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:02,338 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 175 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 69 Unchecked, 0.0s Time] [2022-04-18 20:31:02,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6676 states. [2022-04-18 20:31:02,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6676 to 6523. [2022-04-18 20:31:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6523 states, 6519 states have (on average 4.1253259702408345) internal successors, (26893), 6522 states have internal predecessors, (26893), 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 20:31:02,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6523 states to 6523 states and 26893 transitions. [2022-04-18 20:31:02,527 INFO L78 Accepts]: Start accepts. Automaton has 6523 states and 26893 transitions. Word has length 19 [2022-04-18 20:31:02,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:02,527 INFO L478 AbstractCegarLoop]: Abstraction has 6523 states and 26893 transitions. [2022-04-18 20:31:02,527 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 20:31:02,528 INFO L276 IsEmpty]: Start isEmpty. Operand 6523 states and 26893 transitions. [2022-04-18 20:31:02,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-18 20:31:02,532 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:02,532 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:02,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:02,745 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:02,746 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:02,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:02,746 INFO L85 PathProgramCache]: Analyzing trace with hash 554747729, now seen corresponding path program 1 times [2022-04-18 20:31:02,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:02,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651437907] [2022-04-18 20:31:02,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:31:02,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:02,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:02,748 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:02,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-04-18 20:31:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:31:02,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:02,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:03,093 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 11 treesize of output 7 [2022-04-18 20:31:03,138 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:03,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:03,216 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:03,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:03,310 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:03,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:03,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:03,493 INFO L356 Elim1Store]: treesize reduction 348, result has 9.6 percent of original size [2022-04-18 20:31:03,493 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 5 new quantified variables, introduced 9 case distinctions, treesize of input 77 treesize of output 101 [2022-04-18 20:31:03,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:03,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:03,531 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:03,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 86 [2022-04-18 20:31:03,643 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 20:31:03,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:03,644 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:03,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651437907] [2022-04-18 20:31:03,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651437907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:03,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:03,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:03,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435379469] [2022-04-18 20:31:03,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:03,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:03,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:03,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:03,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:03,645 INFO L87 Difference]: Start difference. First operand 6523 states and 26893 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20:31:03,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:03,742 INFO L93 Difference]: Finished difference Result 6676 states and 27676 transitions. [2022-04-18 20:31:03,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:03,744 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20 [2022-04-18 20:31:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:03,763 INFO L225 Difference]: With dead ends: 6676 [2022-04-18 20:31:03,763 INFO L226 Difference]: Without dead ends: 6676 [2022-04-18 20:31:03,764 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:03,764 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 33 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:03,764 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 186 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 55 Unchecked, 0.0s Time] [2022-04-18 20:31:03,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6676 states. [2022-04-18 20:31:03,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6676 to 6568. [2022-04-18 20:31:03,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6568 states, 6564 states have (on average 4.134064594759293) internal successors, (27136), 6567 states have internal predecessors, (27136), 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 20:31:03,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6568 states to 6568 states and 27136 transitions. [2022-04-18 20:31:03,903 INFO L78 Accepts]: Start accepts. Automaton has 6568 states and 27136 transitions. Word has length 20 [2022-04-18 20:31:03,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:03,904 INFO L478 AbstractCegarLoop]: Abstraction has 6568 states and 27136 transitions. [2022-04-18 20:31:03,904 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20:31:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 6568 states and 27136 transitions. [2022-04-18 20:31:03,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-18 20:31:03,909 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:03,909 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:03,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:04,123 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:04,125 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:04,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:04,125 INFO L85 PathProgramCache]: Analyzing trace with hash 565213019, now seen corresponding path program 2 times [2022-04-18 20:31:04,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:04,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037715425] [2022-04-18 20:31:04,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 20:31:04,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:04,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:04,127 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:04,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-04-18 20:31:04,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-18 20:31:04,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:04,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:04,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:04,510 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 11 treesize of output 7 [2022-04-18 20:31:04,568 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:04,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:04,643 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:04,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:04,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:04,850 INFO L356 Elim1Store]: treesize reduction 312, result has 11.1 percent of original size [2022-04-18 20:31:04,850 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 91 [2022-04-18 20:31:04,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:04,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:04,922 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:04,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 81 [2022-04-18 20:31:05,098 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:05,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:05,232 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 20:31:05,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:05,232 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:05,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037715425] [2022-04-18 20:31:05,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037715425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:05,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:05,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:05,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912637118] [2022-04-18 20:31:05,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:05,234 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:05,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:05,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:05,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:05,234 INFO L87 Difference]: Start difference. First operand 6568 states and 27136 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20:31:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:05,330 INFO L93 Difference]: Finished difference Result 6736 states and 27995 transitions. [2022-04-18 20:31:05,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:05,331 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20 [2022-04-18 20:31:05,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:05,351 INFO L225 Difference]: With dead ends: 6736 [2022-04-18 20:31:05,351 INFO L226 Difference]: Without dead ends: 6736 [2022-04-18 20:31:05,351 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:05,352 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 32 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:05,352 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 194 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 72 Unchecked, 0.0s Time] [2022-04-18 20:31:05,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6736 states. [2022-04-18 20:31:05,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6736 to 6583. [2022-04-18 20:31:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6583 states, 6579 states have (on average 4.136190910472716) internal successors, (27212), 6582 states have internal predecessors, (27212), 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 20:31:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6583 states to 6583 states and 27212 transitions. [2022-04-18 20:31:05,468 INFO L78 Accepts]: Start accepts. Automaton has 6583 states and 27212 transitions. Word has length 20 [2022-04-18 20:31:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:05,468 INFO L478 AbstractCegarLoop]: Abstraction has 6583 states and 27212 transitions. [2022-04-18 20:31:05,469 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20:31:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 6583 states and 27212 transitions. [2022-04-18 20:31:05,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-18 20:31:05,473 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:05,473 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:05,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-04-18 20:31:05,680 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:05,680 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:05,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:05,680 INFO L85 PathProgramCache]: Analyzing trace with hash 565585949, now seen corresponding path program 3 times [2022-04-18 20:31:05,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:05,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846667909] [2022-04-18 20:31:05,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:31:05,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:05,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:05,688 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:05,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-04-18 20:31:05,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:31:05,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:05,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:05,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:06,036 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 11 treesize of output 7 [2022-04-18 20:31:06,086 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:06,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:06,147 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:06,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:06,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:06,294 INFO L356 Elim1Store]: treesize reduction 314, result has 10.5 percent of original size [2022-04-18 20:31:06,294 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 89 [2022-04-18 20:31:06,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:06,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:06,330 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:06,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 79 [2022-04-18 20:31:06,465 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:06,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:06,515 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 20:31:06,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:06,515 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:06,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846667909] [2022-04-18 20:31:06,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846667909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:06,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:06,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:06,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322043130] [2022-04-18 20:31:06,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:06,516 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:06,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:06,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:06,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:06,516 INFO L87 Difference]: Start difference. First operand 6583 states and 27212 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20:31:06,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:06,634 INFO L93 Difference]: Finished difference Result 6796 states and 28329 transitions. [2022-04-18 20:31:06,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:06,635 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20 [2022-04-18 20:31:06,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:06,722 INFO L225 Difference]: With dead ends: 6796 [2022-04-18 20:31:06,722 INFO L226 Difference]: Without dead ends: 6796 [2022-04-18 20:31:06,723 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:06,723 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 39 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:06,723 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 200 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 53 Unchecked, 0.1s Time] [2022-04-18 20:31:06,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6796 states. [2022-04-18 20:31:06,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6796 to 6613. [2022-04-18 20:31:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6613 states, 6609 states have (on average 4.142684218489938) internal successors, (27379), 6612 states have internal predecessors, (27379), 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 20:31:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6613 states to 6613 states and 27379 transitions. [2022-04-18 20:31:06,842 INFO L78 Accepts]: Start accepts. Automaton has 6613 states and 27379 transitions. Word has length 20 [2022-04-18 20:31:06,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:06,843 INFO L478 AbstractCegarLoop]: Abstraction has 6613 states and 27379 transitions. [2022-04-18 20:31:06,843 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20:31:06,843 INFO L276 IsEmpty]: Start isEmpty. Operand 6613 states and 27379 transitions. [2022-04-18 20:31:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-18 20:31:06,849 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:06,849 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:06,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-04-18 20:31:07,055 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:07,056 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:07,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:07,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1003052369, now seen corresponding path program 4 times [2022-04-18 20:31:07,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:07,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294606050] [2022-04-18 20:31:07,057 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:31:07,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:07,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:07,058 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:07,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-04-18 20:31:07,241 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:31:07,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:07,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:07,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:07,403 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 11 treesize of output 7 [2022-04-18 20:31:07,438 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:07,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:07,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:07,560 INFO L356 Elim1Store]: treesize reduction 292, result has 11.2 percent of original size [2022-04-18 20:31:07,560 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 77 [2022-04-18 20:31:07,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:07,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:07,595 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:07,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 72 [2022-04-18 20:31:07,697 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:07,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:07,780 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:07,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:07,829 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 20:31:07,829 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:07,830 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:07,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294606050] [2022-04-18 20:31:07,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294606050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:07,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:07,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:07,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409901830] [2022-04-18 20:31:07,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:07,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:07,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:07,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:07,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:07,831 INFO L87 Difference]: Start difference. First operand 6613 states and 27379 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20:31:07,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:07,925 INFO L93 Difference]: Finished difference Result 6916 states and 29012 transitions. [2022-04-18 20:31:07,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:07,926 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20 [2022-04-18 20:31:07,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:07,944 INFO L225 Difference]: With dead ends: 6916 [2022-04-18 20:31:07,944 INFO L226 Difference]: Without dead ends: 6916 [2022-04-18 20:31:07,945 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:07,945 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 33 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:07,945 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 216 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 101 Unchecked, 0.0s Time] [2022-04-18 20:31:07,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6916 states. [2022-04-18 20:31:08,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6916 to 6658. [2022-04-18 20:31:08,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6658 states, 6654 states have (on average 4.1511872557859935) internal successors, (27622), 6657 states have internal predecessors, (27622), 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 20:31:08,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6658 states to 6658 states and 27622 transitions. [2022-04-18 20:31:08,073 INFO L78 Accepts]: Start accepts. Automaton has 6658 states and 27622 transitions. Word has length 20 [2022-04-18 20:31:08,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:08,074 INFO L478 AbstractCegarLoop]: Abstraction has 6658 states and 27622 transitions. [2022-04-18 20:31:08,074 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20:31:08,074 INFO L276 IsEmpty]: Start isEmpty. Operand 6658 states and 27622 transitions. [2022-04-18 20:31:08,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-18 20:31:08,079 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:08,079 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:08,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:08,286 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:08,286 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:08,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:08,287 INFO L85 PathProgramCache]: Analyzing trace with hash 987947309, now seen corresponding path program 5 times [2022-04-18 20:31:08,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:08,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668524830] [2022-04-18 20:31:08,287 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-18 20:31:08,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:08,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:08,288 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:08,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-04-18 20:31:08,449 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 20:31:08,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:08,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:08,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:08,611 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 11 treesize of output 7 [2022-04-18 20:31:08,656 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:08,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:08,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:08,813 INFO L356 Elim1Store]: treesize reduction 293, result has 10.9 percent of original size [2022-04-18 20:31:08,813 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 76 [2022-04-18 20:31:08,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:08,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:08,857 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:08,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 71 [2022-04-18 20:31:08,967 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:08,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:09,087 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:09,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:09,175 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 20:31:09,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:09,175 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:09,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668524830] [2022-04-18 20:31:09,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668524830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:09,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:09,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:09,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553669295] [2022-04-18 20:31:09,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:09,176 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:09,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:09,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:09,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:09,176 INFO L87 Difference]: Start difference. First operand 6658 states and 27622 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20:31:09,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:09,276 INFO L93 Difference]: Finished difference Result 6826 states and 28481 transitions. [2022-04-18 20:31:09,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:09,280 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20 [2022-04-18 20:31:09,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:09,300 INFO L225 Difference]: With dead ends: 6826 [2022-04-18 20:31:09,300 INFO L226 Difference]: Without dead ends: 6826 [2022-04-18 20:31:09,301 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:09,301 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 32 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:09,301 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 205 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 67 Unchecked, 0.0s Time] [2022-04-18 20:31:09,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6826 states. [2022-04-18 20:31:09,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6826 to 6673. [2022-04-18 20:31:09,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6673 states, 6669 states have (on average 4.15324636377268) internal successors, (27698), 6672 states have internal predecessors, (27698), 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 20:31:09,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6673 states to 6673 states and 27698 transitions. [2022-04-18 20:31:09,450 INFO L78 Accepts]: Start accepts. Automaton has 6673 states and 27698 transitions. Word has length 20 [2022-04-18 20:31:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:09,450 INFO L478 AbstractCegarLoop]: Abstraction has 6673 states and 27698 transitions. [2022-04-18 20:31:09,450 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20:31:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 6673 states and 27698 transitions. [2022-04-18 20:31:09,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-18 20:31:09,456 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:09,456 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:09,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:09,663 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:09,663 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:09,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:09,664 INFO L85 PathProgramCache]: Analyzing trace with hash 988320239, now seen corresponding path program 6 times [2022-04-18 20:31:09,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:09,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618723986] [2022-04-18 20:31:09,664 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-18 20:31:09,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:09,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:09,667 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:09,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-04-18 20:31:09,816 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-04-18 20:31:09,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:09,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:09,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:09,985 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 11 treesize of output 7 [2022-04-18 20:31:10,029 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:10,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:10,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:10,152 INFO L356 Elim1Store]: treesize reduction 293, result has 10.9 percent of original size [2022-04-18 20:31:10,152 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 76 [2022-04-18 20:31:10,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:10,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:10,187 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:10,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 71 [2022-04-18 20:31:10,285 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:10,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:10,385 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:10,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:10,435 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 20:31:10,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:10,435 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:10,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618723986] [2022-04-18 20:31:10,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618723986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:10,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:10,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:10,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875827105] [2022-04-18 20:31:10,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:10,436 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:10,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:10,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:10,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:10,437 INFO L87 Difference]: Start difference. First operand 6673 states and 27698 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20:31:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:10,530 INFO L93 Difference]: Finished difference Result 6886 states and 28815 transitions. [2022-04-18 20:31:10,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:10,531 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20 [2022-04-18 20:31:10,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:10,550 INFO L225 Difference]: With dead ends: 6886 [2022-04-18 20:31:10,550 INFO L226 Difference]: Without dead ends: 6886 [2022-04-18 20:31:10,550 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:10,551 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 38 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:10,551 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 181 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 86 Unchecked, 0.0s Time] [2022-04-18 20:31:10,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6886 states. [2022-04-18 20:31:10,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6886 to 6658. [2022-04-18 20:31:10,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6658 states, 6654 states have (on average 4.1511872557859935) internal successors, (27622), 6657 states have internal predecessors, (27622), 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 20:31:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6658 states to 6658 states and 27622 transitions. [2022-04-18 20:31:10,678 INFO L78 Accepts]: Start accepts. Automaton has 6658 states and 27622 transitions. Word has length 20 [2022-04-18 20:31:10,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:10,678 INFO L478 AbstractCegarLoop]: Abstraction has 6658 states and 27622 transitions. [2022-04-18 20:31:10,678 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20:31:10,678 INFO L276 IsEmpty]: Start isEmpty. Operand 6658 states and 27622 transitions. [2022-04-18 20:31:10,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-18 20:31:10,683 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:10,683 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:10,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:10,889 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:10,890 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:10,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:10,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1552118179, now seen corresponding path program 7 times [2022-04-18 20:31:10,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:10,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305344457] [2022-04-18 20:31:10,891 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-18 20:31:10,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:10,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:10,891 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:10,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-04-18 20:31:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:31:11,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:11,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:11,224 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 11 treesize of output 7 [2022-04-18 20:31:11,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:11,321 INFO L356 Elim1Store]: treesize reduction 282, result has 11.6 percent of original size [2022-04-18 20:31:11,322 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 65 [2022-04-18 20:31:11,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:11,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:11,357 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:11,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 65 [2022-04-18 20:31:11,438 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:11,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:11,499 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:11,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:11,586 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:11,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:11,641 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 20:31:11,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:11,642 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:11,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305344457] [2022-04-18 20:31:11,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305344457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:11,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:11,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:11,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294607348] [2022-04-18 20:31:11,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:11,642 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:11,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:11,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:11,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:11,643 INFO L87 Difference]: Start difference. First operand 6658 states and 27622 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20:31:11,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:11,763 INFO L93 Difference]: Finished difference Result 7006 states and 29498 transitions. [2022-04-18 20:31:11,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:11,764 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20 [2022-04-18 20:31:11,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:11,781 INFO L225 Difference]: With dead ends: 7006 [2022-04-18 20:31:11,781 INFO L226 Difference]: Without dead ends: 7006 [2022-04-18 20:31:11,781 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:11,782 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 40 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:11,782 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 205 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 100 Unchecked, 0.1s Time] [2022-04-18 20:31:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7006 states. [2022-04-18 20:31:11,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7006 to 6688. [2022-04-18 20:31:11,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6688 states, 6684 states have (on average 4.15754039497307) internal successors, (27789), 6687 states have internal predecessors, (27789), 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 20:31:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6688 states to 6688 states and 27789 transitions. [2022-04-18 20:31:11,891 INFO L78 Accepts]: Start accepts. Automaton has 6688 states and 27789 transitions. Word has length 20 [2022-04-18 20:31:11,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:11,891 INFO L478 AbstractCegarLoop]: Abstraction has 6688 states and 27789 transitions. [2022-04-18 20:31:11,892 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20:31:11,892 INFO L276 IsEmpty]: Start isEmpty. Operand 6688 states and 27789 transitions. [2022-04-18 20:31:11,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-18 20:31:11,896 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:11,896 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:11,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:12,103 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:12,104 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:12,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:12,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1907822719, now seen corresponding path program 8 times [2022-04-18 20:31:12,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:12,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084680707] [2022-04-18 20:31:12,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 20:31:12,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:12,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:12,105 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:12,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-04-18 20:31:12,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-18 20:31:12,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:12,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-18 20:31:12,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:12,399 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 11 treesize of output 7 [2022-04-18 20:31:12,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:12,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:12,453 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:12,453 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 1 case distinctions, treesize of input 17 treesize of output 25 [2022-04-18 20:31:12,501 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:12,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:12,576 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:12,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:12,658 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:12,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:12,710 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 20:31:12,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:12,711 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:12,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084680707] [2022-04-18 20:31:12,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2084680707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:12,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:12,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:12,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215725401] [2022-04-18 20:31:12,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:12,712 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:12,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:12,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:12,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:12,712 INFO L87 Difference]: Start difference. First operand 6688 states and 27789 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20:31:12,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:12,888 INFO L93 Difference]: Finished difference Result 6946 states and 29194 transitions. [2022-04-18 20:31:12,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:12,889 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20 [2022-04-18 20:31:12,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:12,905 INFO L225 Difference]: With dead ends: 6946 [2022-04-18 20:31:12,905 INFO L226 Difference]: Without dead ends: 6946 [2022-04-18 20:31:12,906 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:12,906 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 32 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:12,906 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 180 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2022-04-18 20:31:12,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2022-04-18 20:31:12,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 6688. [2022-04-18 20:31:12,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6688 states, 6684 states have (on average 4.15754039497307) internal successors, (27789), 6687 states have internal predecessors, (27789), 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 20:31:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6688 states to 6688 states and 27789 transitions. [2022-04-18 20:31:13,014 INFO L78 Accepts]: Start accepts. Automaton has 6688 states and 27789 transitions. Word has length 20 [2022-04-18 20:31:13,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:13,014 INFO L478 AbstractCegarLoop]: Abstraction has 6688 states and 27789 transitions. [2022-04-18 20:31:13,014 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20:31:13,014 INFO L276 IsEmpty]: Start isEmpty. Operand 6688 states and 27789 transitions. [2022-04-18 20:31:13,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-18 20:31:13,019 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:13,019 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:13,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:13,225 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:13,226 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:13,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:13,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1922927779, now seen corresponding path program 9 times [2022-04-18 20:31:13,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:13,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164006959] [2022-04-18 20:31:13,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:31:13,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:13,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:13,228 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:13,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-04-18 20:31:13,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:31:13,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:13,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:13,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:13,529 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 11 treesize of output 7 [2022-04-18 20:31:13,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:13,649 INFO L356 Elim1Store]: treesize reduction 282, result has 11.6 percent of original size [2022-04-18 20:31:13,650 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 65 [2022-04-18 20:31:13,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:13,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:13,686 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:13,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 65 [2022-04-18 20:31:13,754 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:13,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:13,818 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:13,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:13,905 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:13,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:13,981 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 20:31:13,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:13,981 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:13,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164006959] [2022-04-18 20:31:13,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164006959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:13,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:13,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:13,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435157302] [2022-04-18 20:31:13,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:13,982 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:13,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:13,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:13,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:13,982 INFO L87 Difference]: Start difference. First operand 6688 states and 27789 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20:31:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:14,069 INFO L93 Difference]: Finished difference Result 6826 states and 28496 transitions. [2022-04-18 20:31:14,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:14,076 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20 [2022-04-18 20:31:14,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:14,094 INFO L225 Difference]: With dead ends: 6826 [2022-04-18 20:31:14,095 INFO L226 Difference]: Without dead ends: 6826 [2022-04-18 20:31:14,095 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:14,095 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 38 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:14,096 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 181 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 57 Unchecked, 0.0s Time] [2022-04-18 20:31:14,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6826 states. [2022-04-18 20:31:14,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6826 to 6673. [2022-04-18 20:31:14,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6673 states, 6669 states have (on average 4.1554955765482084) internal successors, (27713), 6672 states have internal predecessors, (27713), 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 20:31:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6673 states to 6673 states and 27713 transitions. [2022-04-18 20:31:14,213 INFO L78 Accepts]: Start accepts. Automaton has 6673 states and 27713 transitions. Word has length 20 [2022-04-18 20:31:14,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:14,214 INFO L478 AbstractCegarLoop]: Abstraction has 6673 states and 27713 transitions. [2022-04-18 20:31:14,214 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20:31:14,214 INFO L276 IsEmpty]: Start isEmpty. Operand 6673 states and 27713 transitions. [2022-04-18 20:31:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-18 20:31:14,219 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:14,219 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:14,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-04-18 20:31:14,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:14,423 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:14,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:14,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1922554849, now seen corresponding path program 10 times [2022-04-18 20:31:14,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:14,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015526378] [2022-04-18 20:31:14,424 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:31:14,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:14,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:14,425 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:14,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-04-18 20:31:14,611 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:31:14,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:14,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-18 20:31:14,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:14,782 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 11 treesize of output 7 [2022-04-18 20:31:14,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:14,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:14,835 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:14,835 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 1 case distinctions, treesize of input 17 treesize of output 25 [2022-04-18 20:31:14,885 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:14,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:14,945 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:14,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:15,042 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:15,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:15,090 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 20:31:15,091 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:15,091 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:15,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015526378] [2022-04-18 20:31:15,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015526378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:15,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:15,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:15,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502907435] [2022-04-18 20:31:15,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:15,091 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:15,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:15,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:15,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:15,092 INFO L87 Difference]: Start difference. First operand 6673 states and 27713 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20:31:15,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:15,182 INFO L93 Difference]: Finished difference Result 6886 states and 28830 transitions. [2022-04-18 20:31:15,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:15,183 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20 [2022-04-18 20:31:15,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:15,200 INFO L225 Difference]: With dead ends: 6886 [2022-04-18 20:31:15,200 INFO L226 Difference]: Without dead ends: 6886 [2022-04-18 20:31:15,200 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:15,201 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 32 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:15,201 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 200 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 76 Unchecked, 0.0s Time] [2022-04-18 20:31:15,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6886 states. [2022-04-18 20:31:15,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6886 to 6643. [2022-04-18 20:31:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6643 states, 6639 states have (on average 4.151378219611387) internal successors, (27561), 6642 states have internal predecessors, (27561), 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 20:31:15,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6643 states to 6643 states and 27561 transitions. [2022-04-18 20:31:15,303 INFO L78 Accepts]: Start accepts. Automaton has 6643 states and 27561 transitions. Word has length 20 [2022-04-18 20:31:15,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:15,303 INFO L478 AbstractCegarLoop]: Abstraction has 6643 states and 27561 transitions. [2022-04-18 20:31:15,303 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 20:31:15,303 INFO L276 IsEmpty]: Start isEmpty. Operand 6643 states and 27561 transitions. [2022-04-18 20:31:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:15,309 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:15,309 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:15,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-04-18 20:31:15,516 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:15,516 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:15,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:15,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1215971285, now seen corresponding path program 1 times [2022-04-18 20:31:15,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:15,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027370589] [2022-04-18 20:31:15,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:31:15,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:15,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:15,518 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:15,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-04-18 20:31:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:31:15,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-18 20:31:15,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:31:15,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:31:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:31:15,849 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:15,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027370589] [2022-04-18 20:31:15,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027370589] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:31:15,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [193750652] [2022-04-18 20:31:15,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:31:15,850 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-04-18 20:31:15,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 [2022-04-18 20:31:15,853 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-04-18 20:31:15,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-04-18 20:31:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:31:16,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-18 20:31:16,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:31:16,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:31:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:31:16,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [193750652] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:31:16,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823683286] [2022-04-18 20:31:16,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:31:16,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:31:16,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:31:16,179 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:31:16,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-18 20:31:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:31:16,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-18 20:31:16,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:16,390 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 20:31:16,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:16,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823683286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:16,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 4 imperfect interpolant sequences. [2022-04-18 20:31:16,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5, 5, 5] total 15 [2022-04-18 20:31:16,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116083672] [2022-04-18 20:31:16,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:16,390 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 20:31:16,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:16,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 20:31:16,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-04-18 20:31:16,391 INFO L87 Difference]: Start difference. First operand 6643 states and 27561 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 20:31:16,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:16,729 INFO L93 Difference]: Finished difference Result 10441 states and 42433 transitions. [2022-04-18 20:31:16,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-18 20:31:16,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:16,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:16,755 INFO L225 Difference]: With dead ends: 10441 [2022-04-18 20:31:16,755 INFO L226 Difference]: Without dead ends: 10441 [2022-04-18 20:31:16,756 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-04-18 20:31:16,756 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 80 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:16,756 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 123 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-18 20:31:16,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10441 states. [2022-04-18 20:31:16,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10441 to 6643. [2022-04-18 20:31:16,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6643 states, 6639 states have (on average 4.151378219611387) internal successors, (27561), 6642 states have internal predecessors, (27561), 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 20:31:16,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6643 states to 6643 states and 27561 transitions. [2022-04-18 20:31:16,883 INFO L78 Accepts]: Start accepts. Automaton has 6643 states and 27561 transitions. Word has length 22 [2022-04-18 20:31:16,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:16,883 INFO L478 AbstractCegarLoop]: Abstraction has 6643 states and 27561 transitions. [2022-04-18 20:31:16,884 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 20:31:16,884 INFO L276 IsEmpty]: Start isEmpty. Operand 6643 states and 27561 transitions. [2022-04-18 20:31:16,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:16,890 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:16,890 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:16,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:17,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:17,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:17,498 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3,25 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:31:17,498 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:17,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:17,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1693228365, now seen corresponding path program 1 times [2022-04-18 20:31:17,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:17,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92782662] [2022-04-18 20:31:17,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:31:17,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:17,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:17,500 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:17,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-04-18 20:31:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:31:17,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-18 20:31:17,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:17,867 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 11 treesize of output 7 [2022-04-18 20:31:17,918 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:17,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:17,980 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:17,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:18,071 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:18,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:18,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:18,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:18,153 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:18,154 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 1 case distinctions, treesize of input 44 treesize of output 46 [2022-04-18 20:31:18,218 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 20:31:18,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:18,218 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:18,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92782662] [2022-04-18 20:31:18,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92782662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:18,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:18,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:18,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329616245] [2022-04-18 20:31:18,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:18,218 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:18,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:18,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:18,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:18,219 INFO L87 Difference]: Start difference. First operand 6643 states and 27561 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:18,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:18,304 INFO L93 Difference]: Finished difference Result 6860 states and 28643 transitions. [2022-04-18 20:31:18,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:18,305 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:18,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:18,323 INFO L225 Difference]: With dead ends: 6860 [2022-04-18 20:31:18,323 INFO L226 Difference]: Without dead ends: 6860 [2022-04-18 20:31:18,323 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:18,324 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 36 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:18,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 177 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 66 Unchecked, 0.0s Time] [2022-04-18 20:31:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6860 states. [2022-04-18 20:31:18,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6860 to 6702. [2022-04-18 20:31:18,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6702 states, 6698 states have (on average 4.1581068975813675) internal successors, (27851), 6701 states have internal predecessors, (27851), 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 20:31:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6702 states to 6702 states and 27851 transitions. [2022-04-18 20:31:18,439 INFO L78 Accepts]: Start accepts. Automaton has 6702 states and 27851 transitions. Word has length 22 [2022-04-18 20:31:18,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:18,440 INFO L478 AbstractCegarLoop]: Abstraction has 6702 states and 27851 transitions. [2022-04-18 20:31:18,440 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:18,440 INFO L276 IsEmpty]: Start isEmpty. Operand 6702 states and 27851 transitions. [2022-04-18 20:31:18,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:18,446 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:18,446 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:18,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:18,653 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:18,654 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:18,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:18,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1693565955, now seen corresponding path program 2 times [2022-04-18 20:31:18,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:18,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155467577] [2022-04-18 20:31:18,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 20:31:18,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:18,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:18,656 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:18,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-04-18 20:31:18,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-18 20:31:18,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:18,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:18,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:19,029 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 11 treesize of output 7 [2022-04-18 20:31:19,060 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:19,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:19,123 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:19,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:19,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:19,243 INFO L356 Elim1Store]: treesize reduction 314, result has 10.5 percent of original size [2022-04-18 20:31:19,244 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 89 [2022-04-18 20:31:19,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:19,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:19,275 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:19,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 79 [2022-04-18 20:31:19,400 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:19,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:19,448 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 20:31:19,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:19,448 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:19,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [155467577] [2022-04-18 20:31:19,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [155467577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:19,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:19,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:19,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048479154] [2022-04-18 20:31:19,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:19,448 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:19,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:19,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:19,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:19,449 INFO L87 Difference]: Start difference. First operand 6702 states and 27851 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:19,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:19,540 INFO L93 Difference]: Finished difference Result 6872 states and 28702 transitions. [2022-04-18 20:31:19,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:19,541 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:19,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:19,557 INFO L225 Difference]: With dead ends: 6872 [2022-04-18 20:31:19,557 INFO L226 Difference]: Without dead ends: 6872 [2022-04-18 20:31:19,557 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:19,558 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 42 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:19,558 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 173 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 68 Unchecked, 0.0s Time] [2022-04-18 20:31:19,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6872 states. [2022-04-18 20:31:19,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6872 to 6705. [2022-04-18 20:31:19,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6705 states, 6701 states have (on average 4.158334576928817) internal successors, (27865), 6704 states have internal predecessors, (27865), 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 20:31:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6705 states to 6705 states and 27865 transitions. [2022-04-18 20:31:19,661 INFO L78 Accepts]: Start accepts. Automaton has 6705 states and 27865 transitions. Word has length 22 [2022-04-18 20:31:19,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:19,661 INFO L478 AbstractCegarLoop]: Abstraction has 6705 states and 27865 transitions. [2022-04-18 20:31:19,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 6705 states and 27865 transitions. [2022-04-18 20:31:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:19,668 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:19,668 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:19,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:19,874 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:19,874 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:19,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:19,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1707202545, now seen corresponding path program 3 times [2022-04-18 20:31:19,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:19,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716608675] [2022-04-18 20:31:19,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:31:19,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:19,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:19,877 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:19,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-04-18 20:31:20,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:31:20,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:20,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:20,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:20,247 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 11 treesize of output 7 [2022-04-18 20:31:20,294 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:20,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:20,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:20,417 INFO L356 Elim1Store]: treesize reduction 292, result has 11.2 percent of original size [2022-04-18 20:31:20,417 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 77 [2022-04-18 20:31:20,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:20,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:20,454 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:20,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 72 [2022-04-18 20:31:20,563 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:20,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:20,657 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:20,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:20,714 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 20:31:20,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:20,714 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:20,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716608675] [2022-04-18 20:31:20,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716608675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:20,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:20,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:20,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217449233] [2022-04-18 20:31:20,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:20,715 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:20,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:20,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:20,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:20,715 INFO L87 Difference]: Start difference. First operand 6705 states and 27865 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:20,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:20,807 INFO L93 Difference]: Finished difference Result 6956 states and 29157 transitions. [2022-04-18 20:31:20,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:20,808 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:20,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:20,826 INFO L225 Difference]: With dead ends: 6956 [2022-04-18 20:31:20,826 INFO L226 Difference]: Without dead ends: 6956 [2022-04-18 20:31:20,827 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:20,827 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 32 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:20,827 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 197 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 114 Unchecked, 0.0s Time] [2022-04-18 20:31:20,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6956 states. [2022-04-18 20:31:20,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6956 to 6726. [2022-04-18 20:31:20,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6726 states, 6722 states have (on average 4.16081523356144) internal successors, (27969), 6725 states have internal predecessors, (27969), 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 20:31:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6726 states to 6726 states and 27969 transitions. [2022-04-18 20:31:20,942 INFO L78 Accepts]: Start accepts. Automaton has 6726 states and 27969 transitions. Word has length 22 [2022-04-18 20:31:20,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:20,943 INFO L478 AbstractCegarLoop]: Abstraction has 6726 states and 27969 transitions. [2022-04-18 20:31:20,943 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 6726 states and 27969 transitions. [2022-04-18 20:31:20,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:20,949 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:20,950 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:20,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-04-18 20:31:21,152 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:21,152 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:21,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:21,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2028945345, now seen corresponding path program 4 times [2022-04-18 20:31:21,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:21,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966336270] [2022-04-18 20:31:21,153 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:31:21,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:21,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:21,154 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:21,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-04-18 20:31:21,339 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:31:21,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:21,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:21,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:21,519 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 11 treesize of output 7 [2022-04-18 20:31:21,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:21,610 INFO L356 Elim1Store]: treesize reduction 283, result has 11.3 percent of original size [2022-04-18 20:31:21,611 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 64 [2022-04-18 20:31:21,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:21,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:21,654 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:21,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 64 [2022-04-18 20:31:21,721 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:21,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:21,779 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:21,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:21,857 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:21,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:21,904 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 20:31:21,905 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:21,905 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:21,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966336270] [2022-04-18 20:31:21,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966336270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:21,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:21,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:21,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500829808] [2022-04-18 20:31:21,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:21,905 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:21,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:21,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:21,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:21,906 INFO L87 Difference]: Start difference. First operand 6726 states and 27969 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:21,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:21,990 INFO L93 Difference]: Finished difference Result 6899 states and 28834 transitions. [2022-04-18 20:31:21,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:21,991 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:21,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:22,007 INFO L225 Difference]: With dead ends: 6899 [2022-04-18 20:31:22,008 INFO L226 Difference]: Without dead ends: 6899 [2022-04-18 20:31:22,008 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:22,008 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 30 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:22,008 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 185 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 94 Unchecked, 0.0s Time] [2022-04-18 20:31:22,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6899 states. [2022-04-18 20:31:22,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6899 to 6732. [2022-04-18 20:31:22,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6732 states, 6728 states have (on average 4.161266349583829) internal successors, (27997), 6731 states have internal predecessors, (27997), 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 20:31:22,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6732 states to 6732 states and 27997 transitions. [2022-04-18 20:31:22,112 INFO L78 Accepts]: Start accepts. Automaton has 6732 states and 27997 transitions. Word has length 22 [2022-04-18 20:31:22,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:22,113 INFO L478 AbstractCegarLoop]: Abstraction has 6732 states and 27997 transitions. [2022-04-18 20:31:22,113 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 6732 states and 27997 transitions. [2022-04-18 20:31:22,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:22,119 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:22,119 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:22,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-04-18 20:31:22,326 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:22,326 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:22,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:22,326 INFO L85 PathProgramCache]: Analyzing trace with hash 52591965, now seen corresponding path program 2 times [2022-04-18 20:31:22,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:22,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624780374] [2022-04-18 20:31:22,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 20:31:22,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:22,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:22,328 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:22,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-04-18 20:31:22,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-18 20:31:22,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:22,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-18 20:31:22,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:22,584 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 20:31:22,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:22,584 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:22,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624780374] [2022-04-18 20:31:22,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624780374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:22,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:22,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:31:22,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97949038] [2022-04-18 20:31:22,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:22,585 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:31:22,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:22,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:31:22,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:31:22,585 INFO L87 Difference]: Start difference. First operand 6732 states and 27997 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 20:31:22,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:22,951 INFO L93 Difference]: Finished difference Result 12576 states and 50820 transitions. [2022-04-18 20:31:22,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-18 20:31:22,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:22,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:22,984 INFO L225 Difference]: With dead ends: 12576 [2022-04-18 20:31:22,984 INFO L226 Difference]: Without dead ends: 12576 [2022-04-18 20:31:22,985 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-04-18 20:31:22,985 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 152 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:22,985 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 135 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-18 20:31:22,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12576 states. [2022-04-18 20:31:23,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12576 to 6928. [2022-04-18 20:31:23,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6928 states, 6924 states have (on average 4.191941074523397) internal successors, (29025), 6927 states have internal predecessors, (29025), 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 20:31:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6928 states to 6928 states and 29025 transitions. [2022-04-18 20:31:23,131 INFO L78 Accepts]: Start accepts. Automaton has 6928 states and 29025 transitions. Word has length 22 [2022-04-18 20:31:23,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:23,132 INFO L478 AbstractCegarLoop]: Abstraction has 6928 states and 29025 transitions. [2022-04-18 20:31:23,132 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 20:31:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 6928 states and 29025 transitions. [2022-04-18 20:31:23,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:23,138 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:23,138 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:23,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:23,343 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:23,343 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:23,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:23,344 INFO L85 PathProgramCache]: Analyzing trace with hash 907488893, now seen corresponding path program 5 times [2022-04-18 20:31:23,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:23,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167826068] [2022-04-18 20:31:23,344 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-18 20:31:23,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:23,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:23,345 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:23,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-04-18 20:31:23,567 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 20:31:23,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:23,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:23,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:23,770 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 11 treesize of output 7 [2022-04-18 20:31:23,842 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:23,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:23,899 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:23,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:24,010 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:24,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:24,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:24,154 INFO L356 Elim1Store]: treesize reduction 348, result has 9.6 percent of original size [2022-04-18 20:31:24,154 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 5 new quantified variables, introduced 9 case distinctions, treesize of input 77 treesize of output 101 [2022-04-18 20:31:24,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:24,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:24,191 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:24,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 86 [2022-04-18 20:31:24,269 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 20:31:24,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:24,270 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:24,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167826068] [2022-04-18 20:31:24,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167826068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:24,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:24,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:24,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917877200] [2022-04-18 20:31:24,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:24,270 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:24,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:24,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:24,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:24,271 INFO L87 Difference]: Start difference. First operand 6928 states and 29025 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:24,358 INFO L93 Difference]: Finished difference Result 7115 states and 29962 transitions. [2022-04-18 20:31:24,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:24,359 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:24,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:24,376 INFO L225 Difference]: With dead ends: 7115 [2022-04-18 20:31:24,377 INFO L226 Difference]: Without dead ends: 7115 [2022-04-18 20:31:24,377 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:24,377 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:24,377 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 183 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 92 Unchecked, 0.0s Time] [2022-04-18 20:31:24,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states. [2022-04-18 20:31:24,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 6954. [2022-04-18 20:31:24,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6954 states, 6950 states have (on average 4.195107913669065) internal successors, (29156), 6953 states have internal predecessors, (29156), 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 20:31:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6954 states to 6954 states and 29156 transitions. [2022-04-18 20:31:24,554 INFO L78 Accepts]: Start accepts. Automaton has 6954 states and 29156 transitions. Word has length 22 [2022-04-18 20:31:24,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:24,554 INFO L478 AbstractCegarLoop]: Abstraction has 6954 states and 29156 transitions. [2022-04-18 20:31:24,554 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:24,554 INFO L276 IsEmpty]: Start isEmpty. Operand 6954 states and 29156 transitions. [2022-04-18 20:31:24,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:24,561 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:24,561 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:24,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:24,767 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:24,768 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:24,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:24,768 INFO L85 PathProgramCache]: Analyzing trace with hash 907826483, now seen corresponding path program 6 times [2022-04-18 20:31:24,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:24,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741986991] [2022-04-18 20:31:24,769 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-18 20:31:24,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:24,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:24,770 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:24,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-04-18 20:31:24,938 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-04-18 20:31:24,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:24,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-18 20:31:24,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:25,103 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 11 treesize of output 7 [2022-04-18 20:31:25,163 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:25,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:25,225 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:25,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:25,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:25,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:25,302 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:25,302 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 1 case distinctions, treesize of input 35 treesize of output 39 [2022-04-18 20:31:25,396 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:25,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:25,445 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 20:31:25,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:25,445 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:25,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741986991] [2022-04-18 20:31:25,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741986991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:25,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:25,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:25,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696836241] [2022-04-18 20:31:25,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:25,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:25,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:25,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:25,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:25,446 INFO L87 Difference]: Start difference. First operand 6954 states and 29156 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:25,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:25,533 INFO L93 Difference]: Finished difference Result 7124 states and 30007 transitions. [2022-04-18 20:31:25,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:25,534 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:25,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:25,551 INFO L225 Difference]: With dead ends: 7124 [2022-04-18 20:31:25,551 INFO L226 Difference]: Without dead ends: 7124 [2022-04-18 20:31:25,551 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:25,552 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 30 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:25,552 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 199 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 91 Unchecked, 0.0s Time] [2022-04-18 20:31:25,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7124 states. [2022-04-18 20:31:25,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7124 to 6945. [2022-04-18 20:31:25,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6945 states, 6941 states have (on average 4.194064255870912) internal successors, (29111), 6944 states have internal predecessors, (29111), 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 20:31:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6945 states to 6945 states and 29111 transitions. [2022-04-18 20:31:25,661 INFO L78 Accepts]: Start accepts. Automaton has 6945 states and 29111 transitions. Word has length 22 [2022-04-18 20:31:25,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:25,662 INFO L478 AbstractCegarLoop]: Abstraction has 6945 states and 29111 transitions. [2022-04-18 20:31:25,662 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:25,662 INFO L276 IsEmpty]: Start isEmpty. Operand 6945 states and 29111 transitions. [2022-04-18 20:31:25,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:25,669 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:25,669 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:25,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:25,877 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:25,877 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:25,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:25,878 INFO L85 PathProgramCache]: Analyzing trace with hash 921463073, now seen corresponding path program 7 times [2022-04-18 20:31:25,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:25,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704861729] [2022-04-18 20:31:25,878 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-18 20:31:25,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:25,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:25,879 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:25,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-04-18 20:31:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:31:26,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:26,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:26,332 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 11 treesize of output 7 [2022-04-18 20:31:26,397 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:26,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:26,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:26,522 INFO L356 Elim1Store]: treesize reduction 291, result has 11.6 percent of original size [2022-04-18 20:31:26,522 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 78 [2022-04-18 20:31:26,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:26,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:26,555 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:26,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 73 [2022-04-18 20:31:26,644 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:26,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:26,716 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:26,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:26,767 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 20:31:26,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:26,768 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:26,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704861729] [2022-04-18 20:31:26,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704861729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:26,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:26,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:26,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167827639] [2022-04-18 20:31:26,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:26,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:26,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:26,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:26,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:26,770 INFO L87 Difference]: Start difference. First operand 6945 states and 29111 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:26,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:26,858 INFO L93 Difference]: Finished difference Result 7133 states and 30052 transitions. [2022-04-18 20:31:26,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:26,858 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:26,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:26,878 INFO L225 Difference]: With dead ends: 7133 [2022-04-18 20:31:26,878 INFO L226 Difference]: Without dead ends: 7133 [2022-04-18 20:31:26,879 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:26,879 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 30 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:26,879 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 217 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 118 Unchecked, 0.0s Time] [2022-04-18 20:31:26,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7133 states. [2022-04-18 20:31:26,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7133 to 6945. [2022-04-18 20:31:26,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6945 states, 6941 states have (on average 4.194064255870912) internal successors, (29111), 6944 states have internal predecessors, (29111), 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 20:31:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6945 states to 6945 states and 29111 transitions. [2022-04-18 20:31:27,010 INFO L78 Accepts]: Start accepts. Automaton has 6945 states and 29111 transitions. Word has length 22 [2022-04-18 20:31:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:27,010 INFO L478 AbstractCegarLoop]: Abstraction has 6945 states and 29111 transitions. [2022-04-18 20:31:27,010 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 6945 states and 29111 transitions. [2022-04-18 20:31:27,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:27,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:27,017 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:27,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:27,225 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:27,225 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:27,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:27,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1243205873, now seen corresponding path program 8 times [2022-04-18 20:31:27,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:27,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848891414] [2022-04-18 20:31:27,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 20:31:27,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:27,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:27,227 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:27,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-04-18 20:31:27,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-18 20:31:27,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:27,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-18 20:31:27,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:27,561 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 11 treesize of output 7 [2022-04-18 20:31:27,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:27,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:27,640 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:27,640 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 1 case distinctions, treesize of input 17 treesize of output 25 [2022-04-18 20:31:27,693 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:27,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:27,764 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:27,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:27,860 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:27,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:27,912 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 20:31:27,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:27,913 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:27,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848891414] [2022-04-18 20:31:27,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1848891414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:27,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:27,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:27,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207583710] [2022-04-18 20:31:27,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:27,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:27,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:27,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:27,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:27,914 INFO L87 Difference]: Start difference. First operand 6945 states and 29111 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:28,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:28,002 INFO L93 Difference]: Finished difference Result 7128 states and 30025 transitions. [2022-04-18 20:31:28,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:28,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:28,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:28,020 INFO L225 Difference]: With dead ends: 7128 [2022-04-18 20:31:28,020 INFO L226 Difference]: Without dead ends: 7128 [2022-04-18 20:31:28,021 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:28,021 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:28,021 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 199 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 74 Unchecked, 0.0s Time] [2022-04-18 20:31:28,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7128 states. [2022-04-18 20:31:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7128 to 6945. [2022-04-18 20:31:28,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6945 states, 6941 states have (on average 4.194064255870912) internal successors, (29111), 6944 states have internal predecessors, (29111), 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 20:31:28,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6945 states to 6945 states and 29111 transitions. [2022-04-18 20:31:28,133 INFO L78 Accepts]: Start accepts. Automaton has 6945 states and 29111 transitions. Word has length 22 [2022-04-18 20:31:28,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:28,133 INFO L478 AbstractCegarLoop]: Abstraction has 6945 states and 29111 transitions. [2022-04-18 20:31:28,133 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:28,134 INFO L276 IsEmpty]: Start isEmpty. Operand 6945 states and 29111 transitions. [2022-04-18 20:31:28,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:28,140 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:28,140 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:28,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (34)] Ended with exit code 0 [2022-04-18 20:31:28,344 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:28,344 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:28,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:28,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1906675511, now seen corresponding path program 9 times [2022-04-18 20:31:28,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:28,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986372571] [2022-04-18 20:31:28,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:31:28,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:28,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:28,346 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:28,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-04-18 20:31:28,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:31:28,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:28,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-18 20:31:28,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:28,743 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 11 treesize of output 7 [2022-04-18 20:31:28,794 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:28,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:28,896 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:28,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:29,048 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:29,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:29,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:29,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:29,144 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:29,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2022-04-18 20:31:29,232 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 20:31:29,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:29,232 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:29,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986372571] [2022-04-18 20:31:29,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986372571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:29,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:29,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:29,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569204406] [2022-04-18 20:31:29,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:29,233 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:29,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:29,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:29,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:29,234 INFO L87 Difference]: Start difference. First operand 6945 states and 29111 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:29,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:29,329 INFO L93 Difference]: Finished difference Result 7114 states and 29958 transitions. [2022-04-18 20:31:29,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:29,330 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:29,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:29,347 INFO L225 Difference]: With dead ends: 7114 [2022-04-18 20:31:29,348 INFO L226 Difference]: Without dead ends: 7114 [2022-04-18 20:31:29,348 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:29,348 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:29,351 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 178 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 73 Unchecked, 0.0s Time] [2022-04-18 20:31:29,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7114 states. [2022-04-18 20:31:29,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7114 to 6962. [2022-04-18 20:31:29,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6962 states, 6958 states have (on average 4.196177062374246) internal successors, (29197), 6961 states have internal predecessors, (29197), 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 20:31:29,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6962 states to 6962 states and 29197 transitions. [2022-04-18 20:31:29,457 INFO L78 Accepts]: Start accepts. Automaton has 6962 states and 29197 transitions. Word has length 22 [2022-04-18 20:31:29,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:29,457 INFO L478 AbstractCegarLoop]: Abstraction has 6962 states and 29197 transitions. [2022-04-18 20:31:29,457 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 6962 states and 29197 transitions. [2022-04-18 20:31:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:29,463 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:29,463 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:29,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:29,669 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:29,669 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:29,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:29,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1907013101, now seen corresponding path program 10 times [2022-04-18 20:31:29,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:29,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492609565] [2022-04-18 20:31:29,670 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:31:29,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:29,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:29,671 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:29,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-04-18 20:31:29,885 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:31:29,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:29,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:29,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:30,048 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 11 treesize of output 7 [2022-04-18 20:31:30,099 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:30,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:30,187 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:30,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:30,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:30,309 INFO L356 Elim1Store]: treesize reduction 313, result has 10.8 percent of original size [2022-04-18 20:31:30,309 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 90 [2022-04-18 20:31:30,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:30,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:30,348 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:30,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 80 [2022-04-18 20:31:30,458 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:30,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:30,507 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 20:31:30,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:30,507 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:30,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492609565] [2022-04-18 20:31:30,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492609565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:30,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:30,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:30,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477663788] [2022-04-18 20:31:30,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:30,508 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:30,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:30,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:30,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:30,508 INFO L87 Difference]: Start difference. First operand 6962 states and 29197 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:30,630 INFO L93 Difference]: Finished difference Result 7123 states and 30003 transitions. [2022-04-18 20:31:30,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:30,631 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:30,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:30,652 INFO L225 Difference]: With dead ends: 7123 [2022-04-18 20:31:30,652 INFO L226 Difference]: Without dead ends: 7123 [2022-04-18 20:31:30,652 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:30,652 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:30,657 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 187 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 72 Unchecked, 0.0s Time] [2022-04-18 20:31:30,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7123 states. [2022-04-18 20:31:30,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7123 to 6953. [2022-04-18 20:31:30,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6953 states, 6949 states have (on average 4.195135990790042) internal successors, (29152), 6952 states have internal predecessors, (29152), 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 20:31:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6953 states to 6953 states and 29152 transitions. [2022-04-18 20:31:30,785 INFO L78 Accepts]: Start accepts. Automaton has 6953 states and 29152 transitions. Word has length 22 [2022-04-18 20:31:30,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:30,786 INFO L478 AbstractCegarLoop]: Abstraction has 6953 states and 29152 transitions. [2022-04-18 20:31:30,786 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 6953 states and 29152 transitions. [2022-04-18 20:31:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:30,793 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:30,794 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:30,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:31,000 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:31,001 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:31,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:31,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1920649691, now seen corresponding path program 11 times [2022-04-18 20:31:31,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:31,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964747692] [2022-04-18 20:31:31,002 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-18 20:31:31,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:31,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:31,009 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:31,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-04-18 20:31:31,230 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 20:31:31,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:31,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:31,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:31,406 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 11 treesize of output 7 [2022-04-18 20:31:31,456 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:31,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:31,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:31,590 INFO L356 Elim1Store]: treesize reduction 293, result has 10.9 percent of original size [2022-04-18 20:31:31,591 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 76 [2022-04-18 20:31:31,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:31,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:31,625 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:31,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 71 [2022-04-18 20:31:31,724 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:31,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:31,809 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:31,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:31,863 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 20:31:31,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:31,863 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:31,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964747692] [2022-04-18 20:31:31,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964747692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:31,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:31,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:31,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871345112] [2022-04-18 20:31:31,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:31,864 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:31,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:31,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:31,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:31,865 INFO L87 Difference]: Start difference. First operand 6953 states and 29152 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:31,963 INFO L93 Difference]: Finished difference Result 7133 states and 30052 transitions. [2022-04-18 20:31:31,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:31,965 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:31,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:31,982 INFO L225 Difference]: With dead ends: 7133 [2022-04-18 20:31:31,982 INFO L226 Difference]: Without dead ends: 7133 [2022-04-18 20:31:31,983 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:31,983 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:31,983 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 181 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 95 Unchecked, 0.0s Time] [2022-04-18 20:31:31,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7133 states. [2022-04-18 20:31:32,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7133 to 6944. [2022-04-18 20:31:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6944 states, 6940 states have (on average 4.194092219020173) internal successors, (29107), 6943 states have internal predecessors, (29107), 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 20:31:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6944 states to 6944 states and 29107 transitions. [2022-04-18 20:31:32,093 INFO L78 Accepts]: Start accepts. Automaton has 6944 states and 29107 transitions. Word has length 22 [2022-04-18 20:31:32,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:32,094 INFO L478 AbstractCegarLoop]: Abstraction has 6944 states and 29107 transitions. [2022-04-18 20:31:32,094 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:32,094 INFO L276 IsEmpty]: Start isEmpty. Operand 6944 states and 29107 transitions. [2022-04-18 20:31:32,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:32,100 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:32,100 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:32,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:32,307 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:32,307 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:32,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:32,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1409819291, now seen corresponding path program 12 times [2022-04-18 20:31:32,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:32,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550168473] [2022-04-18 20:31:32,308 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-18 20:31:32,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:32,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:32,309 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:32,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-04-18 20:31:32,538 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-04-18 20:31:32,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:32,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:32,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:32,783 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 11 treesize of output 7 [2022-04-18 20:31:32,843 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:32,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:32,940 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:32,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:33,061 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:33,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:33,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:33,272 INFO L356 Elim1Store]: treesize reduction 349, result has 9.4 percent of original size [2022-04-18 20:31:33,273 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 5 new quantified variables, introduced 9 case distinctions, treesize of input 77 treesize of output 100 [2022-04-18 20:31:33,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:33,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:33,318 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:33,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 85 [2022-04-18 20:31:33,427 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 20:31:33,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:33,427 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:33,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550168473] [2022-04-18 20:31:33,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550168473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:33,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:33,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:33,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831235690] [2022-04-18 20:31:33,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:33,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:33,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:33,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:33,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:33,428 INFO L87 Difference]: Start difference. First operand 6944 states and 29107 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:33,558 INFO L93 Difference]: Finished difference Result 7115 states and 29980 transitions. [2022-04-18 20:31:33,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:33,560 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:33,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:33,604 INFO L225 Difference]: With dead ends: 7115 [2022-04-18 20:31:33,605 INFO L226 Difference]: Without dead ends: 7115 [2022-04-18 20:31:33,605 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:33,605 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 38 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:33,605 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 202 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 110 Unchecked, 0.1s Time] [2022-04-18 20:31:33,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states. [2022-04-18 20:31:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 6953. [2022-04-18 20:31:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6953 states, 6949 states have (on average 4.195135990790042) internal successors, (29152), 6952 states have internal predecessors, (29152), 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 20:31:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6953 states to 6953 states and 29152 transitions. [2022-04-18 20:31:33,741 INFO L78 Accepts]: Start accepts. Automaton has 6953 states and 29152 transitions. Word has length 22 [2022-04-18 20:31:33,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:33,741 INFO L478 AbstractCegarLoop]: Abstraction has 6953 states and 29152 transitions. [2022-04-18 20:31:33,741 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 6953 states and 29152 transitions. [2022-04-18 20:31:33,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:33,748 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:33,748 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:33,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (38)] Ended with exit code 0 [2022-04-18 20:31:33,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:33,955 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:33,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:33,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1409754067, now seen corresponding path program 3 times [2022-04-18 20:31:33,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:33,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521571795] [2022-04-18 20:31:33,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:31:33,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:33,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:33,958 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:33,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-04-18 20:31:34,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:31:34,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:34,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-18 20:31:34,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:34,257 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 20:31:34,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:34,257 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:34,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521571795] [2022-04-18 20:31:34,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521571795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:34,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:34,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:31:34,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903004739] [2022-04-18 20:31:34,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:34,258 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:31:34,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:34,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:31:34,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:31:34,258 INFO L87 Difference]: Start difference. First operand 6953 states and 29152 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 20:31:34,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:34,605 INFO L93 Difference]: Finished difference Result 12184 states and 50080 transitions. [2022-04-18 20:31:34,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-18 20:31:34,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:34,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:34,652 INFO L225 Difference]: With dead ends: 12184 [2022-04-18 20:31:34,652 INFO L226 Difference]: Without dead ends: 12184 [2022-04-18 20:31:34,652 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-04-18 20:31:34,653 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 149 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:34,653 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 126 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-18 20:31:34,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12184 states. [2022-04-18 20:31:34,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12184 to 7937. [2022-04-18 20:31:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7937 states, 7933 states have (on average 4.189587797806631) internal successors, (33236), 7936 states have internal predecessors, (33236), 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 20:31:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7937 states to 7937 states and 33236 transitions. [2022-04-18 20:31:34,848 INFO L78 Accepts]: Start accepts. Automaton has 7937 states and 33236 transitions. Word has length 22 [2022-04-18 20:31:34,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:34,848 INFO L478 AbstractCegarLoop]: Abstraction has 7937 states and 33236 transitions. [2022-04-18 20:31:34,848 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 20:31:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 7937 states and 33236 transitions. [2022-04-18 20:31:34,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:34,856 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:34,856 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:34,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:35,063 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:35,063 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:35,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:35,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1409755121, now seen corresponding path program 13 times [2022-04-18 20:31:35,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:35,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773162044] [2022-04-18 20:31:35,064 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-18 20:31:35,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:35,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:35,065 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:35,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-04-18 20:31:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:31:35,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:35,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:35,499 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 11 treesize of output 7 [2022-04-18 20:31:35,547 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:35,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:35,612 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:35,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:35,715 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:35,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:35,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:35,900 INFO L356 Elim1Store]: treesize reduction 349, result has 9.4 percent of original size [2022-04-18 20:31:35,901 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 5 new quantified variables, introduced 9 case distinctions, treesize of input 77 treesize of output 100 [2022-04-18 20:31:35,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:35,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:35,950 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:35,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 85 [2022-04-18 20:31:36,087 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 20:31:36,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:36,087 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:36,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773162044] [2022-04-18 20:31:36,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773162044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:36,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:36,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:36,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100095839] [2022-04-18 20:31:36,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:36,088 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:36,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:36,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:36,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:36,088 INFO L87 Difference]: Start difference. First operand 7937 states and 33236 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:36,206 INFO L93 Difference]: Finished difference Result 8072 states and 33908 transitions. [2022-04-18 20:31:36,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:36,207 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:36,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:36,255 INFO L225 Difference]: With dead ends: 8072 [2022-04-18 20:31:36,256 INFO L226 Difference]: Without dead ends: 8072 [2022-04-18 20:31:36,256 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:36,256 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 32 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:36,258 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 223 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 125 Unchecked, 0.0s Time] [2022-04-18 20:31:36,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8072 states. [2022-04-18 20:31:36,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8072 to 7961. [2022-04-18 20:31:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7961 states, 7957 states have (on average 4.191780821917808) internal successors, (33354), 7960 states have internal predecessors, (33354), 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 20:31:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 33354 transitions. [2022-04-18 20:31:36,498 INFO L78 Accepts]: Start accepts. Automaton has 7961 states and 33354 transitions. Word has length 22 [2022-04-18 20:31:36,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:36,498 INFO L478 AbstractCegarLoop]: Abstraction has 7961 states and 33354 transitions. [2022-04-18 20:31:36,498 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 7961 states and 33354 transitions. [2022-04-18 20:31:36,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:36,506 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:36,506 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:36,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:36,713 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:36,714 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:36,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:36,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1422273851, now seen corresponding path program 14 times [2022-04-18 20:31:36,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:36,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765022382] [2022-04-18 20:31:36,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 20:31:36,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:36,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:36,716 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:36,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-04-18 20:31:36,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-18 20:31:36,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:36,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:36,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:37,116 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 11 treesize of output 7 [2022-04-18 20:31:37,176 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:37,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:37,241 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:37,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:37,376 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:37,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:37,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:37,544 INFO L356 Elim1Store]: treesize reduction 348, result has 9.6 percent of original size [2022-04-18 20:31:37,544 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 5 new quantified variables, introduced 9 case distinctions, treesize of input 77 treesize of output 101 [2022-04-18 20:31:37,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:37,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:37,586 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:37,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 86 [2022-04-18 20:31:37,674 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 20:31:37,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:37,675 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:37,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765022382] [2022-04-18 20:31:37,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765022382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:37,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:37,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:37,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955647027] [2022-04-18 20:31:37,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:37,677 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:37,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:37,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:37,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:37,677 INFO L87 Difference]: Start difference. First operand 7961 states and 33354 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:37,785 INFO L93 Difference]: Finished difference Result 8096 states and 34030 transitions. [2022-04-18 20:31:37,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:37,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:37,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:37,808 INFO L225 Difference]: With dead ends: 8096 [2022-04-18 20:31:37,809 INFO L226 Difference]: Without dead ends: 8096 [2022-04-18 20:31:37,820 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:37,821 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:37,821 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 194 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 95 Unchecked, 0.0s Time] [2022-04-18 20:31:37,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8096 states. [2022-04-18 20:31:37,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8096 to 7970. [2022-04-18 20:31:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7970 states, 7966 states have (on average 4.193196083354255) internal successors, (33403), 7969 states have internal predecessors, (33403), 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 20:31:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7970 states to 7970 states and 33403 transitions. [2022-04-18 20:31:37,967 INFO L78 Accepts]: Start accepts. Automaton has 7970 states and 33403 transitions. Word has length 22 [2022-04-18 20:31:37,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:37,967 INFO L478 AbstractCegarLoop]: Abstraction has 7970 states and 33403 transitions. [2022-04-18 20:31:37,968 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:37,968 INFO L276 IsEmpty]: Start isEmpty. Operand 7970 states and 33403 transitions. [2022-04-18 20:31:37,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:37,975 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:37,975 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:37,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (41)] Ended with exit code 0 [2022-04-18 20:31:38,181 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:38,181 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:38,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:38,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1422611441, now seen corresponding path program 15 times [2022-04-18 20:31:38,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:38,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180840151] [2022-04-18 20:31:38,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:31:38,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:38,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:38,183 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:38,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-04-18 20:31:38,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:31:38,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:38,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-18 20:31:38,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:38,643 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 11 treesize of output 7 [2022-04-18 20:31:38,700 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:38,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:38,805 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:38,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:38,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:38,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:38,957 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:38,957 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 1 case distinctions, treesize of input 35 treesize of output 39 [2022-04-18 20:31:39,070 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:39,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:39,126 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 20:31:39,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:39,126 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:39,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180840151] [2022-04-18 20:31:39,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180840151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:39,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:39,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:39,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248352993] [2022-04-18 20:31:39,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:39,127 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:39,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:39,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:39,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:39,129 INFO L87 Difference]: Start difference. First operand 7970 states and 33403 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:39,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:39,249 INFO L93 Difference]: Finished difference Result 8141 states and 34252 transitions. [2022-04-18 20:31:39,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:39,250 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:39,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:39,273 INFO L225 Difference]: With dead ends: 8141 [2022-04-18 20:31:39,273 INFO L226 Difference]: Without dead ends: 8141 [2022-04-18 20:31:39,273 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:39,274 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 30 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:39,274 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 211 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 99 Unchecked, 0.0s Time] [2022-04-18 20:31:39,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8141 states. [2022-04-18 20:31:39,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8141 to 7955. [2022-04-18 20:31:39,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7955 states, 7951 states have (on average 4.191925543956735) internal successors, (33330), 7954 states have internal predecessors, (33330), 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 20:31:39,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7955 states to 7955 states and 33330 transitions. [2022-04-18 20:31:39,416 INFO L78 Accepts]: Start accepts. Automaton has 7955 states and 33330 transitions. Word has length 22 [2022-04-18 20:31:39,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:39,416 INFO L478 AbstractCegarLoop]: Abstraction has 7955 states and 33330 transitions. [2022-04-18 20:31:39,417 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:39,417 INFO L276 IsEmpty]: Start isEmpty. Operand 7955 states and 33330 transitions. [2022-04-18 20:31:39,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:39,424 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:39,424 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:39,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:39,631 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:39,632 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:39,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:39,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1420220411, now seen corresponding path program 16 times [2022-04-18 20:31:39,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:39,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816973689] [2022-04-18 20:31:39,633 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:31:39,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:39,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:39,634 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:39,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-04-18 20:31:39,875 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:31:39,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:39,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-18 20:31:39,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:40,093 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 11 treesize of output 7 [2022-04-18 20:31:40,146 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:40,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:40,217 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:40,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:40,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:40,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:40,335 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:40,335 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 1 case distinctions, treesize of input 35 treesize of output 39 [2022-04-18 20:31:40,449 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:40,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:40,535 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 20:31:40,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:40,535 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:40,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816973689] [2022-04-18 20:31:40,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816973689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:40,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:40,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:40,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312853246] [2022-04-18 20:31:40,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:40,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:40,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:40,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:40,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:40,536 INFO L87 Difference]: Start difference. First operand 7955 states and 33330 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:40,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:40,646 INFO L93 Difference]: Finished difference Result 8111 states and 34106 transitions. [2022-04-18 20:31:40,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:40,647 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:40,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:40,670 INFO L225 Difference]: With dead ends: 8111 [2022-04-18 20:31:40,670 INFO L226 Difference]: Without dead ends: 8111 [2022-04-18 20:31:40,671 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:40,671 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:40,671 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 187 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 91 Unchecked, 0.0s Time] [2022-04-18 20:31:40,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8111 states. [2022-04-18 20:31:40,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8111 to 7976. [2022-04-18 20:31:40,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7976 states, 7972 states have (on average 4.193928750627196) internal successors, (33434), 7975 states have internal predecessors, (33434), 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 20:31:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 33434 transitions. [2022-04-18 20:31:40,820 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 33434 transitions. Word has length 22 [2022-04-18 20:31:40,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:40,820 INFO L478 AbstractCegarLoop]: Abstraction has 7976 states and 33434 transitions. [2022-04-18 20:31:40,820 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:40,820 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 33434 transitions. [2022-04-18 20:31:40,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:40,828 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:40,828 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:40,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:41,035 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:41,036 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:41,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:41,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1420622171, now seen corresponding path program 17 times [2022-04-18 20:31:41,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:41,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855876268] [2022-04-18 20:31:41,037 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-18 20:31:41,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:41,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:41,038 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:41,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-04-18 20:31:41,272 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 20:31:41,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:41,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:41,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:41,443 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 11 treesize of output 7 [2022-04-18 20:31:41,476 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:41,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:41,538 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:41,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:41,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:41,667 INFO L356 Elim1Store]: treesize reduction 313, result has 10.8 percent of original size [2022-04-18 20:31:41,668 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 90 [2022-04-18 20:31:41,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:41,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:41,703 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:41,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 80 [2022-04-18 20:31:41,833 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:41,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:41,881 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 20:31:41,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:41,882 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:41,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855876268] [2022-04-18 20:31:41,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855876268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:41,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:41,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:41,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370151312] [2022-04-18 20:31:41,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:41,882 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:41,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:41,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:41,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:41,882 INFO L87 Difference]: Start difference. First operand 7976 states and 33434 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:41,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:41,972 INFO L93 Difference]: Finished difference Result 8153 states and 34308 transitions. [2022-04-18 20:31:41,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:41,973 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:41,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:41,995 INFO L225 Difference]: With dead ends: 8153 [2022-04-18 20:31:41,995 INFO L226 Difference]: Without dead ends: 8153 [2022-04-18 20:31:41,995 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:41,995 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 38 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:41,996 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 182 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 58 Unchecked, 0.0s Time] [2022-04-18 20:31:42,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8153 states. [2022-04-18 20:31:42,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8153 to 7979. [2022-04-18 20:31:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7979 states, 7975 states have (on average 4.1941065830721005) internal successors, (33448), 7978 states have internal predecessors, (33448), 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 20:31:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7979 states to 7979 states and 33448 transitions. [2022-04-18 20:31:42,185 INFO L78 Accepts]: Start accepts. Automaton has 7979 states and 33448 transitions. Word has length 22 [2022-04-18 20:31:42,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:42,185 INFO L478 AbstractCegarLoop]: Abstraction has 7979 states and 33448 transitions. [2022-04-18 20:31:42,186 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:42,186 INFO L276 IsEmpty]: Start isEmpty. Operand 7979 states and 33448 transitions. [2022-04-18 20:31:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:42,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:42,195 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:42,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (44)] Ended with exit code 0 [2022-04-18 20:31:42,400 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:42,401 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:42,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:42,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1858982321, now seen corresponding path program 18 times [2022-04-18 20:31:42,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:42,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646795318] [2022-04-18 20:31:42,402 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-18 20:31:42,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:42,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:42,403 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:42,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-04-18 20:31:42,618 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-04-18 20:31:42,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:42,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:42,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:42,785 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 11 treesize of output 7 [2022-04-18 20:31:42,832 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:42,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:42,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:42,942 INFO L356 Elim1Store]: treesize reduction 292, result has 11.2 percent of original size [2022-04-18 20:31:42,942 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 77 [2022-04-18 20:31:42,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:42,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:42,977 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:42,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 72 [2022-04-18 20:31:43,072 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:43,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:43,154 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:43,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:43,202 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 20:31:43,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:43,203 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:43,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646795318] [2022-04-18 20:31:43,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646795318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:43,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:43,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:43,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149580829] [2022-04-18 20:31:43,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:43,204 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:43,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:43,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:43,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:43,204 INFO L87 Difference]: Start difference. First operand 7979 states and 33448 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:43,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:43,307 INFO L93 Difference]: Finished difference Result 8240 states and 34738 transitions. [2022-04-18 20:31:43,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:43,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:43,330 INFO L225 Difference]: With dead ends: 8240 [2022-04-18 20:31:43,331 INFO L226 Difference]: Without dead ends: 8240 [2022-04-18 20:31:43,331 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:43,331 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 38 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:43,332 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 198 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 102 Unchecked, 0.0s Time] [2022-04-18 20:31:43,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8240 states. [2022-04-18 20:31:43,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8240 to 8003. [2022-04-18 20:31:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8003 states, 7999 states have (on average 4.19627453431679) internal successors, (33566), 8002 states have internal predecessors, (33566), 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 20:31:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8003 states to 8003 states and 33566 transitions. [2022-04-18 20:31:43,482 INFO L78 Accepts]: Start accepts. Automaton has 8003 states and 33566 transitions. Word has length 22 [2022-04-18 20:31:43,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:43,483 INFO L478 AbstractCegarLoop]: Abstraction has 8003 states and 33566 transitions. [2022-04-18 20:31:43,483 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:43,483 INFO L276 IsEmpty]: Start isEmpty. Operand 8003 states and 33566 transitions. [2022-04-18 20:31:43,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:43,490 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:43,490 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:43,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:43,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:43,691 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:43,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:43,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1842954701, now seen corresponding path program 19 times [2022-04-18 20:31:43,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:43,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360499796] [2022-04-18 20:31:43,692 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-18 20:31:43,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:43,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:43,693 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:43,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-04-18 20:31:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:31:43,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-18 20:31:43,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:44,121 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 11 treesize of output 7 [2022-04-18 20:31:44,162 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:44,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:44,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:44,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:44,231 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:44,232 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 1 case distinctions, treesize of input 26 treesize of output 32 [2022-04-18 20:31:44,297 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:44,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:44,380 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:44,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:44,446 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 20:31:44,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:44,446 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:44,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360499796] [2022-04-18 20:31:44,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360499796] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:44,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:44,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:44,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375267114] [2022-04-18 20:31:44,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:44,447 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:44,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:44,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:44,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:44,447 INFO L87 Difference]: Start difference. First operand 8003 states and 33566 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:44,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:44,539 INFO L93 Difference]: Finished difference Result 8159 states and 34342 transitions. [2022-04-18 20:31:44,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:44,540 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:44,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:44,560 INFO L225 Difference]: With dead ends: 8159 [2022-04-18 20:31:44,560 INFO L226 Difference]: Without dead ends: 8159 [2022-04-18 20:31:44,561 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:44,561 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:44,561 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 218 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 92 Unchecked, 0.0s Time] [2022-04-18 20:31:44,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8159 states. [2022-04-18 20:31:44,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8159 to 8024. [2022-04-18 20:31:44,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8024 states, 8020 states have (on average 4.198254364089776) internal successors, (33670), 8023 states have internal predecessors, (33670), 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 20:31:44,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8024 states to 8024 states and 33670 transitions. [2022-04-18 20:31:44,682 INFO L78 Accepts]: Start accepts. Automaton has 8024 states and 33670 transitions. Word has length 22 [2022-04-18 20:31:44,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:44,682 INFO L478 AbstractCegarLoop]: Abstraction has 8024 states and 33670 transitions. [2022-04-18 20:31:44,682 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 8024 states and 33670 transitions. [2022-04-18 20:31:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:44,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:44,690 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:44,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:44,897 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:44,897 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:44,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:44,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1843356461, now seen corresponding path program 20 times [2022-04-18 20:31:44,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:44,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416717224] [2022-04-18 20:31:44,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 20:31:44,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:44,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:44,898 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:44,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-04-18 20:31:45,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-18 20:31:45,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:45,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:45,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:45,287 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 11 treesize of output 7 [2022-04-18 20:31:45,318 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:45,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:45,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:45,431 INFO L356 Elim1Store]: treesize reduction 292, result has 11.2 percent of original size [2022-04-18 20:31:45,431 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 77 [2022-04-18 20:31:45,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:45,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:45,462 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:45,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 72 [2022-04-18 20:31:45,546 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:45,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:45,639 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:45,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:45,690 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 20:31:45,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:45,691 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:45,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416717224] [2022-04-18 20:31:45,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416717224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:45,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:45,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:45,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299806888] [2022-04-18 20:31:45,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:45,692 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:45,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:45,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:45,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:45,692 INFO L87 Difference]: Start difference. First operand 8024 states and 33670 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:45,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:45,787 INFO L93 Difference]: Finished difference Result 8201 states and 34544 transitions. [2022-04-18 20:31:45,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:45,788 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:45,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:45,807 INFO L225 Difference]: With dead ends: 8201 [2022-04-18 20:31:45,807 INFO L226 Difference]: Without dead ends: 8201 [2022-04-18 20:31:45,808 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:45,808 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 42 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:45,808 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 187 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 90 Unchecked, 0.0s Time] [2022-04-18 20:31:45,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8201 states. [2022-04-18 20:31:45,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8201 to 8003. [2022-04-18 20:31:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8003 states, 7999 states have (on average 4.19627453431679) internal successors, (33566), 8002 states have internal predecessors, (33566), 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 20:31:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8003 states to 8003 states and 33566 transitions. [2022-04-18 20:31:45,930 INFO L78 Accepts]: Start accepts. Automaton has 8003 states and 33566 transitions. Word has length 22 [2022-04-18 20:31:45,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:45,930 INFO L478 AbstractCegarLoop]: Abstraction has 8003 states and 33566 transitions. [2022-04-18 20:31:45,930 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:45,930 INFO L276 IsEmpty]: Start isEmpty. Operand 8003 states and 33566 transitions. [2022-04-18 20:31:45,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:45,937 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:45,938 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:45,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:46,144 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:46,145 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:46,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:46,145 INFO L85 PathProgramCache]: Analyzing trace with hash -668482597, now seen corresponding path program 21 times [2022-04-18 20:31:46,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:46,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729953339] [2022-04-18 20:31:46,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:31:46,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:46,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:46,146 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:46,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2022-04-18 20:31:46,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:31:46,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:46,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:46,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:46,600 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 11 treesize of output 7 [2022-04-18 20:31:46,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:46,710 INFO L356 Elim1Store]: treesize reduction 281, result has 11.9 percent of original size [2022-04-18 20:31:46,711 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 66 [2022-04-18 20:31:46,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:46,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:46,739 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:46,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 66 [2022-04-18 20:31:46,803 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:46,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:46,850 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:46,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:46,952 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:46,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:46,991 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 20:31:46,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:46,991 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:46,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729953339] [2022-04-18 20:31:46,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729953339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:46,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:46,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:46,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092314538] [2022-04-18 20:31:46,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:46,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:46,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:46,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:46,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:46,992 INFO L87 Difference]: Start difference. First operand 8003 states and 33566 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:47,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:47,079 INFO L93 Difference]: Finished difference Result 8441 states and 35805 transitions. [2022-04-18 20:31:47,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:47,079 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:47,102 INFO L225 Difference]: With dead ends: 8441 [2022-04-18 20:31:47,103 INFO L226 Difference]: Without dead ends: 8441 [2022-04-18 20:31:47,103 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:47,103 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 49 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:47,103 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 175 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 112 Unchecked, 0.0s Time] [2022-04-18 20:31:47,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8441 states. [2022-04-18 20:31:47,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8441 to 8057. [2022-04-18 20:31:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8057 states, 8053 states have (on average 4.2016639761579535) internal successors, (33836), 8056 states have internal predecessors, (33836), 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 20:31:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8057 states to 8057 states and 33836 transitions. [2022-04-18 20:31:47,260 INFO L78 Accepts]: Start accepts. Automaton has 8057 states and 33836 transitions. Word has length 22 [2022-04-18 20:31:47,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:47,260 INFO L478 AbstractCegarLoop]: Abstraction has 8057 states and 33836 transitions. [2022-04-18 20:31:47,260 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 8057 states and 33836 transitions. [2022-04-18 20:31:47,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:47,268 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:47,268 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:47,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (48)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:47,475 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:47,475 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:47,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:47,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1051892767, now seen corresponding path program 22 times [2022-04-18 20:31:47,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:47,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076058200] [2022-04-18 20:31:47,476 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:31:47,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:47,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:47,477 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:47,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2022-04-18 20:31:47,732 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:31:47,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:47,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:47,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:47,891 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 11 treesize of output 7 [2022-04-18 20:31:47,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:47,988 INFO L356 Elim1Store]: treesize reduction 282, result has 11.6 percent of original size [2022-04-18 20:31:47,988 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 65 [2022-04-18 20:31:47,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:48,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:48,019 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:48,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 65 [2022-04-18 20:31:48,079 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:48,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:48,147 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:48,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:48,224 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:48,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:48,270 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 20:31:48,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:48,270 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:48,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076058200] [2022-04-18 20:31:48,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076058200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:48,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:48,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:48,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723655574] [2022-04-18 20:31:48,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:48,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:48,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:48,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:48,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:48,271 INFO L87 Difference]: Start difference. First operand 8057 states and 33836 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:48,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:48,382 INFO L93 Difference]: Finished difference Result 8255 states and 34814 transitions. [2022-04-18 20:31:48,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:48,383 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:48,402 INFO L225 Difference]: With dead ends: 8255 [2022-04-18 20:31:48,403 INFO L226 Difference]: Without dead ends: 8255 [2022-04-18 20:31:48,403 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:48,403 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 36 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:48,403 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 193 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 90 Unchecked, 0.0s Time] [2022-04-18 20:31:48,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8255 states. [2022-04-18 20:31:48,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8255 to 8057. [2022-04-18 20:31:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8057 states, 8053 states have (on average 4.2016639761579535) internal successors, (33836), 8056 states have internal predecessors, (33836), 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 20:31:48,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8057 states to 8057 states and 33836 transitions. [2022-04-18 20:31:48,594 INFO L78 Accepts]: Start accepts. Automaton has 8057 states and 33836 transitions. Word has length 22 [2022-04-18 20:31:48,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:48,594 INFO L478 AbstractCegarLoop]: Abstraction has 8057 states and 33836 transitions. [2022-04-18 20:31:48,594 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:48,595 INFO L276 IsEmpty]: Start isEmpty. Operand 8057 states and 33836 transitions. [2022-04-18 20:31:48,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:48,602 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:48,602 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:48,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (49)] Ended with exit code 0 [2022-04-18 20:31:48,808 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:48,809 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:48,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:48,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1067920387, now seen corresponding path program 23 times [2022-04-18 20:31:48,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:48,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62327089] [2022-04-18 20:31:48,810 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-18 20:31:48,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:48,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:48,811 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:48,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2022-04-18 20:31:49,057 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 20:31:49,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:49,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:49,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:49,286 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 11 treesize of output 7 [2022-04-18 20:31:49,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:49,415 INFO L356 Elim1Store]: treesize reduction 283, result has 11.3 percent of original size [2022-04-18 20:31:49,415 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 64 [2022-04-18 20:31:49,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:49,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:49,453 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:49,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 64 [2022-04-18 20:31:49,526 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:49,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:49,595 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:49,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:49,687 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:49,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:49,773 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 20:31:49,773 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:49,774 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:49,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62327089] [2022-04-18 20:31:49,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62327089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:49,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:49,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:49,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543166034] [2022-04-18 20:31:49,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:49,774 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:49,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:49,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:49,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:49,774 INFO L87 Difference]: Start difference. First operand 8057 states and 33836 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:49,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:49,883 INFO L93 Difference]: Finished difference Result 8171 states and 34404 transitions. [2022-04-18 20:31:49,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:49,884 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:49,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:49,906 INFO L225 Difference]: With dead ends: 8171 [2022-04-18 20:31:49,907 INFO L226 Difference]: Without dead ends: 8171 [2022-04-18 20:31:49,907 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:49,908 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 30 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:49,908 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 181 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 68 Unchecked, 0.0s Time] [2022-04-18 20:31:49,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8171 states. [2022-04-18 20:31:50,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8171 to 8036. [2022-04-18 20:31:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8036 states, 8032 states have (on average 4.199701195219124) internal successors, (33732), 8035 states have internal predecessors, (33732), 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 20:31:50,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8036 states to 8036 states and 33732 transitions. [2022-04-18 20:31:50,058 INFO L78 Accepts]: Start accepts. Automaton has 8036 states and 33732 transitions. Word has length 22 [2022-04-18 20:31:50,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:50,059 INFO L478 AbstractCegarLoop]: Abstraction has 8036 states and 33732 transitions. [2022-04-18 20:31:50,059 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:50,059 INFO L276 IsEmpty]: Start isEmpty. Operand 8036 states and 33732 transitions. [2022-04-18 20:31:50,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:50,067 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:50,067 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:50,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (50)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:50,274 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:50,274 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:50,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:50,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1067518627, now seen corresponding path program 24 times [2022-04-18 20:31:50,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:50,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386906492] [2022-04-18 20:31:50,275 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-18 20:31:50,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:50,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:50,276 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:50,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2022-04-18 20:31:50,490 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-04-18 20:31:50,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:50,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:31:50,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:50,662 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 11 treesize of output 7 [2022-04-18 20:31:50,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:50,822 INFO L356 Elim1Store]: treesize reduction 283, result has 11.3 percent of original size [2022-04-18 20:31:50,823 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 64 [2022-04-18 20:31:50,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:50,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:50,861 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:31:50,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 64 [2022-04-18 20:31:50,937 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:50,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:31:51,007 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:31:51,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:31:51,121 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:31:51,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, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:31:51,180 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 20:31:51,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:51,181 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:51,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386906492] [2022-04-18 20:31:51,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386906492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:51,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:51,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:31:51,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389209857] [2022-04-18 20:31:51,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:51,182 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:31:51,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:51,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:31:51,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:31:51,182 INFO L87 Difference]: Start difference. First operand 8036 states and 33732 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:51,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:51,290 INFO L93 Difference]: Finished difference Result 8213 states and 34606 transitions. [2022-04-18 20:31:51,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:31:51,291 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:51,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:51,313 INFO L225 Difference]: With dead ends: 8213 [2022-04-18 20:31:51,314 INFO L226 Difference]: Without dead ends: 8213 [2022-04-18 20:31:51,314 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:51,314 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 30 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:51,314 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 206 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 75 Unchecked, 0.0s Time] [2022-04-18 20:31:51,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8213 states. [2022-04-18 20:31:51,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8213 to 7994. [2022-04-18 20:31:51,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7994 states, 7990 states have (on average 4.195744680851064) internal successors, (33524), 7993 states have internal predecessors, (33524), 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 20:31:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7994 states to 7994 states and 33524 transitions. [2022-04-18 20:31:51,463 INFO L78 Accepts]: Start accepts. Automaton has 7994 states and 33524 transitions. Word has length 22 [2022-04-18 20:31:51,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:51,463 INFO L478 AbstractCegarLoop]: Abstraction has 7994 states and 33524 transitions. [2022-04-18 20:31:51,464 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:31:51,464 INFO L276 IsEmpty]: Start isEmpty. Operand 7994 states and 33524 transitions. [2022-04-18 20:31:51,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:51,471 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:51,471 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:51,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (51)] Ended with exit code 0 [2022-04-18 20:31:51,678 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:51,679 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:51,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:51,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1871921161, now seen corresponding path program 4 times [2022-04-18 20:31:51,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:51,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31184888] [2022-04-18 20:31:51,680 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:31:51,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:51,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:51,681 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:51,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2022-04-18 20:31:51,840 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:31:51,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:51,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-18 20:31:51,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:31:51,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:31:52,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:31:52,025 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:52,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31184888] [2022-04-18 20:31:52,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31184888] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:31:52,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [330693456] [2022-04-18 20:31:52,026 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:31:52,026 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-04-18 20:31:52,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 [2022-04-18 20:31:52,027 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-04-18 20:31:52,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (53)] Waiting until timeout for monitored process [2022-04-18 20:31:52,363 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:31:52,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:52,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-18 20:31:52,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:31:52,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:31:52,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:31:52,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [330693456] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:31:52,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228524516] [2022-04-18 20:31:52,494 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:31:52,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:31:52,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:31:52,495 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:31:52,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-18 20:31:52,682 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:31:52,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:52,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-18 20:31:52,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:52,768 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 20:31:52,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:52,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228524516] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:52,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 4 imperfect interpolant sequences. [2022-04-18 20:31:52,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5, 5, 5] total 15 [2022-04-18 20:31:52,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94978018] [2022-04-18 20:31:52,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:52,769 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 20:31:52,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:52,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 20:31:52,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-04-18 20:31:52,770 INFO L87 Difference]: Start difference. First operand 7994 states and 33524 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 20:31:53,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:53,078 INFO L93 Difference]: Finished difference Result 12614 states and 51652 transitions. [2022-04-18 20:31:53,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:31:53,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:53,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:53,117 INFO L225 Difference]: With dead ends: 12614 [2022-04-18 20:31:53,117 INFO L226 Difference]: Without dead ends: 12614 [2022-04-18 20:31:53,117 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-04-18 20:31:53,118 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 103 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:53,118 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 153 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-18 20:31:53,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12614 states. [2022-04-18 20:31:53,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12614 to 8110. [2022-04-18 20:31:53,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8110 states, 8106 states have (on average 4.208240809277079) internal successors, (34112), 8109 states have internal predecessors, (34112), 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 20:31:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8110 states to 8110 states and 34112 transitions. [2022-04-18 20:31:53,310 INFO L78 Accepts]: Start accepts. Automaton has 8110 states and 34112 transitions. Word has length 22 [2022-04-18 20:31:53,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:53,310 INFO L478 AbstractCegarLoop]: Abstraction has 8110 states and 34112 transitions. [2022-04-18 20:31:53,311 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 20:31:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 8110 states and 34112 transitions. [2022-04-18 20:31:53,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:53,318 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:53,318 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:53,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-04-18 20:31:53,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (52)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:53,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (53)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:53,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,52 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3,53 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt [2022-04-18 20:31:53,931 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:53,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:53,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1254994669, now seen corresponding path program 5 times [2022-04-18 20:31:53,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:53,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722763902] [2022-04-18 20:31:53,932 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-18 20:31:53,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:53,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:53,933 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:53,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (55)] Waiting until timeout for monitored process [2022-04-18 20:31:54,142 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 20:31:54,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:54,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-18 20:31:54,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:31:54,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:31:54,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:31:54,396 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:54,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722763902] [2022-04-18 20:31:54,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722763902] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:31:54,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [268162848] [2022-04-18 20:31:54,396 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-18 20:31:54,396 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-04-18 20:31:54,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 [2022-04-18 20:31:54,397 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-04-18 20:31:54,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (56)] Waiting until timeout for monitored process [2022-04-18 20:31:54,760 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 20:31:54,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:54,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-18 20:31:54,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:31:54,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:31:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:31:54,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [268162848] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:31:54,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371956471] [2022-04-18 20:31:54,952 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-18 20:31:54,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:31:54,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:31:54,953 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:31:54,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-18 20:31:55,164 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 20:31:55,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:55,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-18 20:31:55,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:55,255 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 20:31:55,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:55,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371956471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:55,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 4 imperfect interpolant sequences. [2022-04-18 20:31:55,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5, 5, 5] total 15 [2022-04-18 20:31:55,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347925796] [2022-04-18 20:31:55,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:55,256 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 20:31:55,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:55,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 20:31:55,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-04-18 20:31:55,256 INFO L87 Difference]: Start difference. First operand 8110 states and 34112 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 20:31:55,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:55,646 INFO L93 Difference]: Finished difference Result 15756 states and 64688 transitions. [2022-04-18 20:31:55,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:31:55,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:55,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:55,688 INFO L225 Difference]: With dead ends: 15756 [2022-04-18 20:31:55,689 INFO L226 Difference]: Without dead ends: 15756 [2022-04-18 20:31:55,689 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-04-18 20:31:55,689 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 105 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:55,689 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 179 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-18 20:31:55,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15756 states. [2022-04-18 20:31:55,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15756 to 7412. [2022-04-18 20:31:55,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7412 states, 7408 states have (on average 4.126214902807775) internal successors, (30567), 7411 states have internal predecessors, (30567), 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 20:31:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7412 states to 7412 states and 30567 transitions. [2022-04-18 20:31:55,961 INFO L78 Accepts]: Start accepts. Automaton has 7412 states and 30567 transitions. Word has length 22 [2022-04-18 20:31:55,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:55,961 INFO L478 AbstractCegarLoop]: Abstraction has 7412 states and 30567 transitions. [2022-04-18 20:31:55,961 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 20:31:55,962 INFO L276 IsEmpty]: Start isEmpty. Operand 7412 states and 30567 transitions. [2022-04-18 20:31:55,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:55,967 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:55,968 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:55,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (55)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:56,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (56)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:56,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:56,577 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3,56 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt,57 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:31:56,577 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:56,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:56,578 INFO L85 PathProgramCache]: Analyzing trace with hash 302398936, now seen corresponding path program 1 times [2022-04-18 20:31:56,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:56,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244965976] [2022-04-18 20:31:56,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:31:56,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:56,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:56,579 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:56,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (58)] Waiting until timeout for monitored process [2022-04-18 20:31:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:31:56,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-18 20:31:56,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:56,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:31:56,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:31:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:31:57,053 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:57,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244965976] [2022-04-18 20:31:57,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244965976] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:31:57,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1423403274] [2022-04-18 20:31:57,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:31:57,053 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-04-18 20:31:57,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 [2022-04-18 20:31:57,054 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-04-18 20:31:57,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (59)] Waiting until timeout for monitored process [2022-04-18 20:31:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:31:57,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-18 20:31:57,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:57,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:31:57,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:31:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:31:57,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1423403274] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:31:57,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784719681] [2022-04-18 20:31:57,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:31:57,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:31:57,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:31:57,578 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:31:57,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-18 20:31:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:31:57,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-18 20:31:57,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:57,897 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 20:31:57,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:57,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784719681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:57,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 4 imperfect interpolant sequences. [2022-04-18 20:31:57,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5, 5, 5] total 15 [2022-04-18 20:31:57,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450238381] [2022-04-18 20:31:57,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:57,897 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 20:31:57,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:57,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 20:31:57,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-04-18 20:31:57,898 INFO L87 Difference]: Start difference. First operand 7412 states and 30567 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 20:31:58,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:58,259 INFO L93 Difference]: Finished difference Result 12506 states and 51092 transitions. [2022-04-18 20:31:58,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:31:58,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:58,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:58,297 INFO L225 Difference]: With dead ends: 12506 [2022-04-18 20:31:58,297 INFO L226 Difference]: Without dead ends: 12506 [2022-04-18 20:31:58,298 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-04-18 20:31:58,298 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 101 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:58,298 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 208 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-18 20:31:58,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12506 states. [2022-04-18 20:31:58,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 8751. [2022-04-18 20:31:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8751 states, 8747 states have (on average 4.13799016805762) internal successors, (36195), 8750 states have internal predecessors, (36195), 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 20:31:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8751 states to 8751 states and 36195 transitions. [2022-04-18 20:31:58,492 INFO L78 Accepts]: Start accepts. Automaton has 8751 states and 36195 transitions. Word has length 22 [2022-04-18 20:31:58,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:58,492 INFO L478 AbstractCegarLoop]: Abstraction has 8751 states and 36195 transitions. [2022-04-18 20:31:58,492 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 20:31:58,493 INFO L276 IsEmpty]: Start isEmpty. Operand 8751 states and 36195 transitions. [2022-04-18 20:31:58,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:58,501 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:58,501 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:58,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2022-04-18 20:31:58,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (58)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:58,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (59)] Forceful destruction successful, exit code 0 [2022-04-18 20:31:59,103 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,58 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3,59 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt [2022-04-18 20:31:59,104 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:59,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:59,104 INFO L85 PathProgramCache]: Analyzing trace with hash 302417195, now seen corresponding path program 1 times [2022-04-18 20:31:59,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:59,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024430508] [2022-04-18 20:31:59,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:31:59,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:59,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:59,105 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:59,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (61)] Waiting until timeout for monitored process [2022-04-18 20:31:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:31:59,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-18 20:31:59,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:59,386 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 20:31:59,386 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:31:59,386 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:31:59,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024430508] [2022-04-18 20:31:59,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024430508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:59,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:59,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 20:31:59,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897822772] [2022-04-18 20:31:59,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:59,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-18 20:31:59,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:31:59,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-18 20:31:59,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-18 20:31:59,387 INFO L87 Difference]: Start difference. First operand 8751 states and 36195 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 20:31:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:59,557 INFO L93 Difference]: Finished difference Result 10019 states and 40217 transitions. [2022-04-18 20:31:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-18 20:31:59,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2022-04-18 20:31:59,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:59,582 INFO L225 Difference]: With dead ends: 10019 [2022-04-18 20:31:59,582 INFO L226 Difference]: Without dead ends: 10019 [2022-04-18 20:31:59,582 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-18 20:31:59,582 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 53 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:59,583 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 86 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-18 20:31:59,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10019 states. [2022-04-18 20:31:59,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10019 to 9571. [2022-04-18 20:31:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9571 states, 9567 states have (on average 4.0708686108497965) internal successors, (38946), 9570 states have internal predecessors, (38946), 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 20:31:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9571 states to 9571 states and 38946 transitions. [2022-04-18 20:31:59,732 INFO L78 Accepts]: Start accepts. Automaton has 9571 states and 38946 transitions. Word has length 22 [2022-04-18 20:31:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:59,732 INFO L478 AbstractCegarLoop]: Abstraction has 9571 states and 38946 transitions. [2022-04-18 20:31:59,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 20:31:59,733 INFO L276 IsEmpty]: Start isEmpty. Operand 9571 states and 38946 transitions. [2022-04-18 20:31:59,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:31:59,739 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:59,739 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:59,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (61)] Ended with exit code 0 [2022-04-18 20:31:59,946 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:31:59,946 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:31:59,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:59,946 INFO L85 PathProgramCache]: Analyzing trace with hash 302396146, now seen corresponding path program 2 times [2022-04-18 20:31:59,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:31:59,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362973796] [2022-04-18 20:31:59,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 20:31:59,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:31:59,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:31:59,947 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:31:59,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (62)] Waiting until timeout for monitored process [2022-04-18 20:32:00,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-18 20:32:00,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:32:00,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-18 20:32:00,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:32:00,277 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 20:32:00,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:32:00,277 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:32:00,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362973796] [2022-04-18 20:32:00,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1362973796] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:32:00,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:32:00,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:32:00,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077345479] [2022-04-18 20:32:00,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:32:00,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:32:00,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:32:00,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:32:00,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:32:00,278 INFO L87 Difference]: Start difference. First operand 9571 states and 38946 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 20:32:00,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:32:00,574 INFO L93 Difference]: Finished difference Result 15132 states and 60918 transitions. [2022-04-18 20:32:00,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-18 20:32:00,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-04-18 20:32:00,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:32:00,613 INFO L225 Difference]: With dead ends: 15132 [2022-04-18 20:32:00,613 INFO L226 Difference]: Without dead ends: 15132 [2022-04-18 20:32:00,613 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-04-18 20:32:00,613 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 154 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:32:00,614 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 198 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-18 20:32:00,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15132 states. [2022-04-18 20:32:00,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15132 to 13295. [2022-04-18 20:32:00,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13295 states, 13291 states have (on average 4.1168459860055675) internal successors, (54717), 13294 states have internal predecessors, (54717), 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 20:32:00,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13295 states to 13295 states and 54717 transitions. [2022-04-18 20:32:00,858 INFO L78 Accepts]: Start accepts. Automaton has 13295 states and 54717 transitions. Word has length 22 [2022-04-18 20:32:00,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:32:00,858 INFO L478 AbstractCegarLoop]: Abstraction has 13295 states and 54717 transitions. [2022-04-18 20:32:00,858 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 20:32:00,858 INFO L276 IsEmpty]: Start isEmpty. Operand 13295 states and 54717 transitions. [2022-04-18 20:32:00,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:32:00,867 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:32:00,867 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:32:00,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (62)] Ended with exit code 0 [2022-04-18 20:32:01,067 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:32:01,067 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:32:01,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:32:01,068 INFO L85 PathProgramCache]: Analyzing trace with hash 302394069, now seen corresponding path program 1 times [2022-04-18 20:32:01,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:32:01,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796132107] [2022-04-18 20:32:01,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:32:01,068 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:32:01,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:32:01,069 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:32:01,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (63)] Waiting until timeout for monitored process [2022-04-18 20:32:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:32:01,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-18 20:32:01,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:32:01,503 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 11 treesize of output 7 [2022-04-18 20:32:01,544 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:32:01,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:32:01,606 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:32:01,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:32:01,699 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:32:01,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:32:01,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:01,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:01,830 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:32:01,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 1 case distinctions, treesize of input 44 treesize of output 46 [2022-04-18 20:32:01,911 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 20:32:01,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:32:01,911 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:32:01,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796132107] [2022-04-18 20:32:01,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796132107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:32:01,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:32:01,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:32:01,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616854213] [2022-04-18 20:32:01,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:32:01,912 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:32:01,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:32:01,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:32:01,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:32:01,912 INFO L87 Difference]: Start difference. First operand 13295 states and 54717 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:32:02,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:32:02,029 INFO L93 Difference]: Finished difference Result 13518 states and 55717 transitions. [2022-04-18 20:32:02,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:32:02,030 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:32:02,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:32:02,065 INFO L225 Difference]: With dead ends: 13518 [2022-04-18 20:32:02,065 INFO L226 Difference]: Without dead ends: 13518 [2022-04-18 20:32:02,065 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:32:02,065 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 38 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:32:02,066 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 182 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 74 Unchecked, 0.0s Time] [2022-04-18 20:32:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13518 states. [2022-04-18 20:32:02,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13518 to 13350. [2022-04-18 20:32:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13350 states, 13346 states have (on average 4.118312603027125) internal successors, (54963), 13349 states have internal predecessors, (54963), 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 20:32:02,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13350 states to 13350 states and 54963 transitions. [2022-04-18 20:32:02,351 INFO L78 Accepts]: Start accepts. Automaton has 13350 states and 54963 transitions. Word has length 22 [2022-04-18 20:32:02,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:32:02,352 INFO L478 AbstractCegarLoop]: Abstraction has 13350 states and 54963 transitions. [2022-04-18 20:32:02,352 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:32:02,352 INFO L276 IsEmpty]: Start isEmpty. Operand 13350 states and 54963 transitions. [2022-04-18 20:32:02,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:32:02,361 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:32:02,361 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:32:02,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (63)] Ended with exit code 0 [2022-04-18 20:32:02,567 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:32:02,568 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:32:02,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:32:02,568 INFO L85 PathProgramCache]: Analyzing trace with hash 302334549, now seen corresponding path program 2 times [2022-04-18 20:32:02,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:32:02,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781272442] [2022-04-18 20:32:02,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 20:32:02,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:32:02,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:32:02,569 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:32:02,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (64)] Waiting until timeout for monitored process [2022-04-18 20:32:02,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-18 20:32:02,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:32:02,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-18 20:32:02,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:32:03,004 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 11 treesize of output 7 [2022-04-18 20:32:03,079 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:32:03,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:32:03,170 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:32:03,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:32:03,264 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:32:03,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:32:03,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:03,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:03,403 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:32:03,403 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 1 case distinctions, treesize of input 44 treesize of output 46 [2022-04-18 20:32:03,456 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 20:32:03,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:32:03,456 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:32:03,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781272442] [2022-04-18 20:32:03,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781272442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:32:03,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:32:03,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:32:03,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205350921] [2022-04-18 20:32:03,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:32:03,457 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:32:03,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:32:03,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:32:03,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:32:03,458 INFO L87 Difference]: Start difference. First operand 13350 states and 54963 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:32:03,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:32:03,580 INFO L93 Difference]: Finished difference Result 13620 states and 56255 transitions. [2022-04-18 20:32:03,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:32:03,581 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:32:03,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:32:03,622 INFO L225 Difference]: With dead ends: 13620 [2022-04-18 20:32:03,622 INFO L226 Difference]: Without dead ends: 13620 [2022-04-18 20:32:03,622 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:32:03,626 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 39 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:32:03,627 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 174 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 80 Unchecked, 0.0s Time] [2022-04-18 20:32:03,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13620 states. [2022-04-18 20:32:03,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13620 to 13460. [2022-04-18 20:32:03,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13460 states, 13456 states have (on average 4.125222948870392) internal successors, (55509), 13459 states have internal predecessors, (55509), 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 20:32:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13460 states to 13460 states and 55509 transitions. [2022-04-18 20:32:03,889 INFO L78 Accepts]: Start accepts. Automaton has 13460 states and 55509 transitions. Word has length 22 [2022-04-18 20:32:03,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:32:03,889 INFO L478 AbstractCegarLoop]: Abstraction has 13460 states and 55509 transitions. [2022-04-18 20:32:03,889 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:32:03,889 INFO L276 IsEmpty]: Start isEmpty. Operand 13460 states and 55509 transitions. [2022-04-18 20:32:03,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:32:03,899 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:32:03,899 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, 1] [2022-04-18 20:32:03,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (64)] Ended with exit code 0 [2022-04-18 20:32:04,103 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:32:04,103 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:32:04,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:32:04,104 INFO L85 PathProgramCache]: Analyzing trace with hash 536777381, now seen corresponding path program 1 times [2022-04-18 20:32:04,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:32:04,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203536705] [2022-04-18 20:32:04,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:32:04,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:32:04,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:32:04,105 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:32:04,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (65)] Waiting until timeout for monitored process [2022-04-18 20:32:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:32:04,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:32:04,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:32:04,572 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 11 treesize of output 7 [2022-04-18 20:32:04,654 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:32:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:32:04,716 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:32:04,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:32:04,809 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:32:04,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:32:04,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:04,950 INFO L356 Elim1Store]: treesize reduction 348, result has 9.6 percent of original size [2022-04-18 20:32:04,950 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 5 new quantified variables, introduced 9 case distinctions, treesize of input 77 treesize of output 101 [2022-04-18 20:32:04,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:04,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:04,985 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:32:04,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 86 [2022-04-18 20:32:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:32:05,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:32:05,251 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (v_ArrVal_4443 (Array (_ BitVec 32) (_ BitVec 1))) (~A~0.offset (_ BitVec 32))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse0 ~A~0.offset) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_4443) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (forall ((thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (v_ArrVal_4443 (Array (_ BitVec 32) (_ BitVec 1))) (~A~0.offset (_ BitVec 32))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse1 ~A~0.offset) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_4443) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)) (_ bv0 1))) (forall ((thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (v_ArrVal_4443 (Array (_ BitVec 32) (_ BitVec 1))) (~A~0.offset (_ BitVec 32))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse2 ~A~0.offset) (_ bv0 1)) (bvadd .cse2 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse2 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse2 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_4443) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)) (_ bv0 1))) (forall ((thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (v_ArrVal_4443 (Array (_ BitVec 32) (_ BitVec 1))) (~A~0.offset (_ BitVec 32))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse3 ~A~0.offset) (_ bv0 1)) (bvadd .cse3 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse3 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse3 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_4443) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))))) is different from false [2022-04-18 20:32:37,790 WARN L232 SmtUtils]: Spent 12.52s on a formula simplification. DAG size of input: 155 DAG size of output: 46 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-04-18 20:32:37,791 INFO L356 Elim1Store]: treesize reduction 1789, result has 5.1 percent of original size [2022-04-18 20:32:37,791 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 8 case distinctions, treesize of input 94 treesize of output 108 [2022-04-18 20:32:37,807 INFO L356 Elim1Store]: treesize reduction 447, result has 0.2 percent of original size [2022-04-18 20:32:37,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 121 treesize of output 58 [2022-04-18 20:32:50,183 WARN L232 SmtUtils]: Spent 12.36s on a formula simplification. DAG size of input: 155 DAG size of output: 1 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-04-18 20:32:50,184 INFO L356 Elim1Store]: treesize reduction 1884, result has 0.1 percent of original size [2022-04-18 20:32:50,184 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 8 case distinctions, treesize of input 94 treesize of output 1 [2022-04-18 20:32:50,764 INFO L356 Elim1Store]: treesize reduction 1884, result has 0.1 percent of original size [2022-04-18 20:32:50,764 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 8 case distinctions, treesize of input 92 treesize of output 1 [2022-04-18 20:32:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-04-18 20:32:53,727 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:32:53,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203536705] [2022-04-18 20:32:53,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203536705] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:32:53,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2072945541] [2022-04-18 20:32:53,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:32:53,727 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-04-18 20:32:53,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 [2022-04-18 20:32:53,728 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-04-18 20:32:53,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (66)] Waiting until timeout for monitored process [2022-04-18 20:32:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:32:54,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-18 20:32:54,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:32:57,377 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 11 treesize of output 7 [2022-04-18 20:32:58,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:58,111 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 21 treesize of output 20 [2022-04-18 20:32:58,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:58,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:58,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:58,955 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:32:58,955 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 1 case distinctions, treesize of input 30 treesize of output 32 [2022-04-18 20:32:59,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:59,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:59,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:59,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:59,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:59,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:59,050 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:32:59,050 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 3 case distinctions, treesize of input 39 treesize of output 44 [2022-04-18 20:32:59,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:59,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:59,190 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:32:59,190 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 1 case distinctions, treesize of input 44 treesize of output 46 [2022-04-18 20:33:00,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:33:00,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:33:00,587 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4517 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_4516 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_4516) c_~C~0.base v_ArrVal_4517) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) (forall ((v_ArrVal_4517 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_4516 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_4516) c_~C~0.base v_ArrVal_4517) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) (forall ((v_ArrVal_4517 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_4516 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_4516) c_~C~0.base v_ArrVal_4517) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) (forall ((v_ArrVal_4517 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_4516 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_4516) c_~C~0.base v_ArrVal_4517) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) is different from false [2022-04-18 20:33:15,496 INFO L356 Elim1Store]: treesize reduction 167, result has 18.9 percent of original size [2022-04-18 20:33:15,497 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 4 case distinctions, treesize of input 38 treesize of output 54 [2022-04-18 20:33:15,502 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-04-18 20:33:15,502 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 98 treesize of output 70 [2022-04-18 20:33:15,518 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 20:33:15,520 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 43 treesize of output 35 [2022-04-18 20:33:15,559 INFO L356 Elim1Store]: treesize reduction 205, result has 0.5 percent of original size [2022-04-18 20:33:15,559 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 4 case distinctions, treesize of input 38 treesize of output 1 [2022-04-18 20:33:15,576 INFO L356 Elim1Store]: treesize reduction 205, result has 0.5 percent of original size [2022-04-18 20:33:15,576 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 4 case distinctions, treesize of input 36 treesize of output 1 [2022-04-18 20:33:15,590 INFO L356 Elim1Store]: treesize reduction 205, result has 0.5 percent of original size [2022-04-18 20:33:15,590 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 4 case distinctions, treesize of input 38 treesize of output 1 [2022-04-18 20:33:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-04-18 20:33:17,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2072945541] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:33:17,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14258343] [2022-04-18 20:33:17,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:33:17,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:33:17,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:33:17,863 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:33:17,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-04-18 20:33:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:33:18,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-18 20:33:18,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:33:18,115 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 19 treesize of output 17 [2022-04-18 20:33:20,668 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 11 treesize of output 7 [2022-04-18 20:33:21,686 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:33:21,686 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 21 treesize of output 23 [2022-04-18 20:33:21,921 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:33:21,921 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 30 treesize of output 38 [2022-04-18 20:33:22,172 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:33:22,173 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 39 treesize of output 53 [2022-04-18 20:33:22,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:33:22,373 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:33:22,374 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 1 case distinctions, treesize of input 44 treesize of output 46 [2022-04-18 20:33:22,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:33:22,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:33:22,518 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4592 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_4591 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_4591) c_~C~0.base v_ArrVal_4592) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (forall ((v_ArrVal_4592 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_4591 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_4591) c_~C~0.base v_ArrVal_4592) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) (forall ((v_ArrVal_4592 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_4591 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_4591) c_~C~0.base v_ArrVal_4592) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) (forall ((v_ArrVal_4592 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_4591 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_4591) c_~C~0.base v_ArrVal_4592) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))))) is different from false [2022-04-18 20:33:37,777 INFO L356 Elim1Store]: treesize reduction 165, result has 19.9 percent of original size [2022-04-18 20:33:37,778 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 4 case distinctions, treesize of input 38 treesize of output 56 [2022-04-18 20:33:37,785 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-04-18 20:33:37,786 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 170 treesize of output 136 [2022-04-18 20:33:37,793 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 104 treesize of output 88 [2022-04-18 20:33:37,798 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 49 treesize of output 41 [2022-04-18 20:33:37,857 INFO L356 Elim1Store]: treesize reduction 205, result has 0.5 percent of original size [2022-04-18 20:33:37,857 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 4 case distinctions, treesize of input 38 treesize of output 1 [2022-04-18 20:33:37,881 INFO L356 Elim1Store]: treesize reduction 205, result has 0.5 percent of original size [2022-04-18 20:33:37,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1 [2022-04-18 20:33:37,904 INFO L356 Elim1Store]: treesize reduction 205, result has 0.5 percent of original size [2022-04-18 20:33:37,905 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 4 case distinctions, treesize of input 36 treesize of output 1 [2022-04-18 20:33:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-04-18 20:33:37,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14258343] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:33:37,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-04-18 20:33:37,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 42 [2022-04-18 20:33:37,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582495762] [2022-04-18 20:33:37,989 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-04-18 20:33:37,989 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-18 20:33:37,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:33:37,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-18 20:33:37,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1230, Unknown=108, NotChecked=240, Total=1892 [2022-04-18 20:33:37,990 INFO L87 Difference]: Start difference. First operand 13460 states and 55509 transitions. Second operand has 44 states, 43 states have (on average 2.488372093023256) internal successors, (107), 43 states have internal predecessors, (107), 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 20:33:43,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:33:43,490 INFO L93 Difference]: Finished difference Result 13724 states and 56718 transitions. [2022-04-18 20:33:43,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-18 20:33:43,492 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.488372093023256) internal successors, (107), 43 states have internal predecessors, (107), 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 22 [2022-04-18 20:33:43,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:33:43,532 INFO L225 Difference]: With dead ends: 13724 [2022-04-18 20:33:43,532 INFO L226 Difference]: Without dead ends: 13724 [2022-04-18 20:33:43,533 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 70.3s TimeCoverageRelationStatistics Valid=358, Invalid=1352, Unknown=108, NotChecked=252, Total=2070 [2022-04-18 20:33:43,533 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 90 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:33:43,533 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 448 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 211 Unchecked, 0.1s Time] [2022-04-18 20:33:43,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13724 states. [2022-04-18 20:33:43,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13724 to 13525. [2022-04-18 20:33:43,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13525 states, 13521 states have (on average 4.128540788403225) internal successors, (55822), 13524 states have internal predecessors, (55822), 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 20:33:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13525 states to 13525 states and 55822 transitions. [2022-04-18 20:33:43,860 INFO L78 Accepts]: Start accepts. Automaton has 13525 states and 55822 transitions. Word has length 22 [2022-04-18 20:33:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:33:43,861 INFO L478 AbstractCegarLoop]: Abstraction has 13525 states and 55822 transitions. [2022-04-18 20:33:43,861 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.488372093023256) internal successors, (107), 43 states have internal predecessors, (107), 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 20:33:43,861 INFO L276 IsEmpty]: Start isEmpty. Operand 13525 states and 55822 transitions. [2022-04-18 20:33:43,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:33:43,870 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:33:43,870 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:33:43,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-04-18 20:33:44,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (66)] Ended with exit code 0 [2022-04-18 20:33:44,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (65)] Ended with exit code 0 [2022-04-18 20:33:44,486 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,66 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt,65 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:33:44,486 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:33:44,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:33:44,487 INFO L85 PathProgramCache]: Analyzing trace with hash 536777226, now seen corresponding path program 11 times [2022-04-18 20:33:44,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:33:44,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603070870] [2022-04-18 20:33:44,487 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-18 20:33:44,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:33:44,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:33:44,488 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:33:44,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (68)] Waiting until timeout for monitored process [2022-04-18 20:33:44,751 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 20:33:44,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:33:44,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-18 20:33:44,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:33:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:33:44,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:33:45,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:33:45,054 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:33:45,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603070870] [2022-04-18 20:33:45,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603070870] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:33:45,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [998058160] [2022-04-18 20:33:45,054 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-18 20:33:45,054 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-04-18 20:33:45,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 [2022-04-18 20:33:45,055 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-04-18 20:33:45,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (69)] Waiting until timeout for monitored process [2022-04-18 20:33:45,790 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 20:33:45,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:33:45,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-18 20:33:45,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:33:45,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:33:45,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:33:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:33:45,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [998058160] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:33:45,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553270726] [2022-04-18 20:33:45,996 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-18 20:33:45,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:33:45,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:33:46,010 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:33:46,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-04-18 20:33:46,289 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 20:33:46,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:33:46,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-18 20:33:46,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:33:46,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:33:46,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:33:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:33:46,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553270726] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:33:46,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-04-18 20:33:46,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 13 [2022-04-18 20:33:46,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632534736] [2022-04-18 20:33:46,456 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-04-18 20:33:46,456 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-18 20:33:46,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:33:46,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-18 20:33:46,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-18 20:33:46,457 INFO L87 Difference]: Start difference. First operand 13525 states and 55822 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:33:47,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:33:47,250 INFO L93 Difference]: Finished difference Result 25146 states and 100557 transitions. [2022-04-18 20:33:47,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-18 20:33:47,255 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-04-18 20:33:47,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:33:47,324 INFO L225 Difference]: With dead ends: 25146 [2022-04-18 20:33:47,324 INFO L226 Difference]: Without dead ends: 25146 [2022-04-18 20:33:47,324 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2022-04-18 20:33:47,325 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 441 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-18 20:33:47,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 547 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-18 20:33:47,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25146 states. [2022-04-18 20:33:47,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25146 to 21486. [2022-04-18 20:33:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21486 states, 21481 states have (on average 4.096364228853405) internal successors, (87994), 21485 states have internal predecessors, (87994), 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 20:33:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21486 states to 21486 states and 87994 transitions. [2022-04-18 20:33:47,733 INFO L78 Accepts]: Start accepts. Automaton has 21486 states and 87994 transitions. Word has length 22 [2022-04-18 20:33:47,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:33:47,734 INFO L478 AbstractCegarLoop]: Abstraction has 21486 states and 87994 transitions. [2022-04-18 20:33:47,734 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:33:47,734 INFO L276 IsEmpty]: Start isEmpty. Operand 21486 states and 87994 transitions. [2022-04-18 20:33:47,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:33:47,746 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:33:47,746 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:33:47,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (69)] Forceful destruction successful, exit code 0 [2022-04-18 20:33:47,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2022-04-18 20:33:48,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (68)] Forceful destruction successful, exit code 0 [2022-04-18 20:33:48,359 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt,70 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,68 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:33:48,359 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:33:48,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:33:48,360 INFO L85 PathProgramCache]: Analyzing trace with hash 526797365, now seen corresponding path program 6 times [2022-04-18 20:33:48,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:33:48,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530627368] [2022-04-18 20:33:48,360 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-18 20:33:48,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:33:48,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:33:48,361 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:33:48,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (71)] Waiting until timeout for monitored process [2022-04-18 20:33:48,605 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-04-18 20:33:48,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:33:48,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-18 20:33:48,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:33:48,704 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 20:33:48,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:33:48,704 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:33:48,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530627368] [2022-04-18 20:33:48,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530627368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:33:48,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:33:48,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:33:48,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780761032] [2022-04-18 20:33:48,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:33:48,705 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:33:48,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:33:48,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:33:48,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:33:48,706 INFO L87 Difference]: Start difference. First operand 21486 states and 87994 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 20:33:49,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:33:49,178 INFO L93 Difference]: Finished difference Result 28741 states and 117092 transitions. [2022-04-18 20:33:49,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-18 20:33:49,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-04-18 20:33:49,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:33:49,261 INFO L225 Difference]: With dead ends: 28741 [2022-04-18 20:33:49,261 INFO L226 Difference]: Without dead ends: 28741 [2022-04-18 20:33:49,262 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-04-18 20:33:49,262 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 171 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-18 20:33:49,262 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 199 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-18 20:33:49,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28741 states. [2022-04-18 20:33:49,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28741 to 21928. [2022-04-18 20:33:49,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21928 states, 21923 states have (on average 4.093463485836792) internal successors, (89741), 21927 states have internal predecessors, (89741), 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 20:33:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21928 states to 21928 states and 89741 transitions. [2022-04-18 20:33:49,838 INFO L78 Accepts]: Start accepts. Automaton has 21928 states and 89741 transitions. Word has length 22 [2022-04-18 20:33:49,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:33:49,838 INFO L478 AbstractCegarLoop]: Abstraction has 21928 states and 89741 transitions. [2022-04-18 20:33:49,839 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 20:33:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 21928 states and 89741 transitions. [2022-04-18 20:33:49,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:33:49,849 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:33:49,849 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:33:49,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (71)] Ended with exit code 0 [2022-04-18 20:33:50,055 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:33:50,055 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:33:50,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:33:50,056 INFO L85 PathProgramCache]: Analyzing trace with hash 528365686, now seen corresponding path program 3 times [2022-04-18 20:33:50,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:33:50,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244222950] [2022-04-18 20:33:50,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:33:50,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:33:50,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:33:50,057 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:33:50,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (72)] Waiting until timeout for monitored process [2022-04-18 20:33:50,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:33:50,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:33:50,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-18 20:33:50,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:33:50,404 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 20:33:50,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:33:50,404 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:33:50,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244222950] [2022-04-18 20:33:50,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244222950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:33:50,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:33:50,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:33:50,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131098573] [2022-04-18 20:33:50,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:33:50,404 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:33:50,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:33:50,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:33:50,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:33:50,405 INFO L87 Difference]: Start difference. First operand 21928 states and 89741 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 20:33:50,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:33:50,791 INFO L93 Difference]: Finished difference Result 30966 states and 127271 transitions. [2022-04-18 20:33:50,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-18 20:33:50,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-04-18 20:33:50,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:33:50,882 INFO L225 Difference]: With dead ends: 30966 [2022-04-18 20:33:50,882 INFO L226 Difference]: Without dead ends: 30966 [2022-04-18 20:33:50,883 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-04-18 20:33:50,883 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 185 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:33:50,883 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 199 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-18 20:33:50,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30966 states. [2022-04-18 20:33:51,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30966 to 20924. [2022-04-18 20:33:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20924 states, 20919 states have (on average 4.079019073569483) internal successors, (85329), 20923 states have internal predecessors, (85329), 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 20:33:51,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20924 states to 20924 states and 85329 transitions. [2022-04-18 20:33:51,327 INFO L78 Accepts]: Start accepts. Automaton has 20924 states and 85329 transitions. Word has length 22 [2022-04-18 20:33:51,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:33:51,327 INFO L478 AbstractCegarLoop]: Abstraction has 20924 states and 85329 transitions. [2022-04-18 20:33:51,328 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 20:33:51,328 INFO L276 IsEmpty]: Start isEmpty. Operand 20924 states and 85329 transitions. [2022-04-18 20:33:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:33:51,338 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:33:51,338 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:33:51,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (72)] Forceful destruction successful, exit code 0 [2022-04-18 20:33:51,544 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:33:51,544 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:33:51,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:33:51,545 INFO L85 PathProgramCache]: Analyzing trace with hash -605595997, now seen corresponding path program 3 times [2022-04-18 20:33:51,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:33:51,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9849364] [2022-04-18 20:33:51,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:33:51,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:33:51,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:33:51,546 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:33:51,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (73)] Waiting until timeout for monitored process [2022-04-18 20:33:51,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:33:51,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:33:51,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:33:51,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:33:51,946 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 11 treesize of output 7 [2022-04-18 20:33:51,985 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:33:51,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:33:52,052 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:33:52,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:33:52,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:33:52,206 INFO L356 Elim1Store]: treesize reduction 315, result has 10.3 percent of original size [2022-04-18 20:33:52,207 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 88 [2022-04-18 20:33:52,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:33:52,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:33:52,241 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:33:52,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 78 [2022-04-18 20:33:52,344 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:33:52,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:33:52,403 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 20:33:52,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:33:52,403 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:33:52,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9849364] [2022-04-18 20:33:52,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9849364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:33:52,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:33:52,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:33:52,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832989795] [2022-04-18 20:33:52,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:33:52,404 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:33:52,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:33:52,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:33:52,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:33:52,404 INFO L87 Difference]: Start difference. First operand 20924 states and 85329 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:33:52,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:33:52,541 INFO L93 Difference]: Finished difference Result 21156 states and 86329 transitions. [2022-04-18 20:33:52,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:33:52,541 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:33:52,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:33:52,597 INFO L225 Difference]: With dead ends: 21156 [2022-04-18 20:33:52,597 INFO L226 Difference]: Without dead ends: 21156 [2022-04-18 20:33:52,597 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:33:52,598 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 42 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:33:52,598 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 170 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 74 Unchecked, 0.0s Time] [2022-04-18 20:33:52,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21156 states. [2022-04-18 20:33:52,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21156 to 21004. [2022-04-18 20:33:52,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21004 states, 20999 states have (on average 4.079479975236916) internal successors, (85665), 21003 states have internal predecessors, (85665), 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 20:33:53,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21004 states to 21004 states and 85665 transitions. [2022-04-18 20:33:53,049 INFO L78 Accepts]: Start accepts. Automaton has 21004 states and 85665 transitions. Word has length 22 [2022-04-18 20:33:53,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:33:53,049 INFO L478 AbstractCegarLoop]: Abstraction has 21004 states and 85665 transitions. [2022-04-18 20:33:53,049 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:33:53,049 INFO L276 IsEmpty]: Start isEmpty. Operand 21004 states and 85665 transitions. [2022-04-18 20:33:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:33:53,059 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:33:53,059 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:33:53,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (73)] Forceful destruction successful, exit code 0 [2022-04-18 20:33:53,261 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:33:53,261 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:33:53,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:33:53,262 INFO L85 PathProgramCache]: Analyzing trace with hash -605317927, now seen corresponding path program 4 times [2022-04-18 20:33:53,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:33:53,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970331304] [2022-04-18 20:33:53,262 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:33:53,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:33:53,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:33:53,263 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:33:53,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (74)] Waiting until timeout for monitored process [2022-04-18 20:33:53,597 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:33:53,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:33:53,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:33:53,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:33:53,768 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 11 treesize of output 7 [2022-04-18 20:33:53,815 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:33:53,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:33:53,875 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:33:53,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:33:53,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:33:54,055 INFO L356 Elim1Store]: treesize reduction 314, result has 10.5 percent of original size [2022-04-18 20:33:54,055 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 89 [2022-04-18 20:33:54,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:33:54,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:33:54,090 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:33:54,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 79 [2022-04-18 20:33:54,205 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:33:54,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:33:54,252 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 20:33:54,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:33:54,252 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:33:54,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970331304] [2022-04-18 20:33:54,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970331304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:33:54,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:33:54,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:33:54,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681041663] [2022-04-18 20:33:54,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:33:54,253 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:33:54,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:33:54,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:33:54,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:33:54,253 INFO L87 Difference]: Start difference. First operand 21004 states and 85665 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:33:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:33:54,402 INFO L93 Difference]: Finished difference Result 21492 states and 87867 transitions. [2022-04-18 20:33:54,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:33:54,403 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:33:54,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:33:54,460 INFO L225 Difference]: With dead ends: 21492 [2022-04-18 20:33:54,460 INFO L226 Difference]: Without dead ends: 21492 [2022-04-18 20:33:54,460 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:33:54,461 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 34 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:33:54,461 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 205 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 90 Unchecked, 0.0s Time] [2022-04-18 20:33:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21492 states. [2022-04-18 20:33:54,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21492 to 21068. [2022-04-18 20:33:54,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21068 states, 21063 states have (on average 4.079998100935289) internal successors, (85937), 21067 states have internal predecessors, (85937), 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 20:33:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21068 states to 21068 states and 85937 transitions. [2022-04-18 20:33:54,814 INFO L78 Accepts]: Start accepts. Automaton has 21068 states and 85937 transitions. Word has length 22 [2022-04-18 20:33:54,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:33:54,814 INFO L478 AbstractCegarLoop]: Abstraction has 21068 states and 85937 transitions. [2022-04-18 20:33:54,814 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:33:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand 21068 states and 85937 transitions. [2022-04-18 20:33:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:33:54,824 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:33:54,824 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:33:54,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (74)] Ended with exit code 0 [2022-04-18 20:33:55,028 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 74 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:33:55,029 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:33:55,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:33:55,029 INFO L85 PathProgramCache]: Analyzing trace with hash -607500637, now seen corresponding path program 5 times [2022-04-18 20:33:55,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:33:55,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598422206] [2022-04-18 20:33:55,029 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-18 20:33:55,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:33:55,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:33:55,030 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:33:55,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (75)] Waiting until timeout for monitored process [2022-04-18 20:33:55,339 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 20:33:55,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:33:55,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:33:55,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:33:55,479 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 11 treesize of output 7 [2022-04-18 20:33:55,524 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:33:55,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:33:55,584 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:33:55,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:33:55,716 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:33:55,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:33:55,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:33:55,864 INFO L356 Elim1Store]: treesize reduction 347, result has 9.9 percent of original size [2022-04-18 20:33:55,864 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 5 new quantified variables, introduced 9 case distinctions, treesize of input 77 treesize of output 102 [2022-04-18 20:33:55,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:33:55,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:33:55,898 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:33:55,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 87 [2022-04-18 20:33:55,977 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 20:33:55,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:33:55,978 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:33:55,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598422206] [2022-04-18 20:33:55,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598422206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:33:55,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:33:55,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:33:55,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485250498] [2022-04-18 20:33:55,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:33:55,978 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:33:55,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:33:55,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:33:55,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:33:55,979 INFO L87 Difference]: Start difference. First operand 21068 states and 85937 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:33:56,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:33:56,127 INFO L93 Difference]: Finished difference Result 21442 states and 87618 transitions. [2022-04-18 20:33:56,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:33:56,128 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:33:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:33:56,185 INFO L225 Difference]: With dead ends: 21442 [2022-04-18 20:33:56,185 INFO L226 Difference]: Without dead ends: 21442 [2022-04-18 20:33:56,185 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:33:56,186 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 30 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:33:56,186 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 189 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 89 Unchecked, 0.0s Time] [2022-04-18 20:33:56,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21442 states. [2022-04-18 20:33:56,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21442 to 21188. [2022-04-18 20:33:56,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21188 states, 21183 states have (on average 4.083699192748902) internal successors, (86505), 21187 states have internal predecessors, (86505), 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 20:33:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21188 states to 21188 states and 86505 transitions. [2022-04-18 20:33:56,720 INFO L78 Accepts]: Start accepts. Automaton has 21188 states and 86505 transitions. Word has length 22 [2022-04-18 20:33:56,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:33:56,720 INFO L478 AbstractCegarLoop]: Abstraction has 21188 states and 86505 transitions. [2022-04-18 20:33:56,720 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:33:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 21188 states and 86505 transitions. [2022-04-18 20:33:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:33:56,731 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:33:56,731 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:33:56,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (75)] Ended with exit code 0 [2022-04-18 20:33:56,937 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:33:56,938 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:33:56,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:33:56,938 INFO L85 PathProgramCache]: Analyzing trace with hash -607163047, now seen corresponding path program 6 times [2022-04-18 20:33:56,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:33:56,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372698684] [2022-04-18 20:33:56,939 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-18 20:33:56,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:33:56,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:33:56,940 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:33:56,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (76)] Waiting until timeout for monitored process [2022-04-18 20:33:57,317 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-04-18 20:33:57,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:33:57,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-18 20:33:57,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:33:57,485 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 11 treesize of output 7 [2022-04-18 20:33:57,521 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:33:57,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:33:57,602 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:33:57,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:33:57,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:33:57,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:33:57,748 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:33:57,749 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 1 case distinctions, treesize of input 35 treesize of output 39 [2022-04-18 20:33:57,852 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:33:57,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:33:57,905 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 20:33:57,905 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:33:57,906 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:33:57,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372698684] [2022-04-18 20:33:57,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372698684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:33:57,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:33:57,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:33:57,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847542409] [2022-04-18 20:33:57,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:33:57,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:33:57,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:33:57,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:33:57,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:33:57,907 INFO L87 Difference]: Start difference. First operand 21188 states and 86505 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:33:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:33:58,053 INFO L93 Difference]: Finished difference Result 21704 states and 88919 transitions. [2022-04-18 20:33:58,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:33:58,053 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:33:58,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:33:58,112 INFO L225 Difference]: With dead ends: 21704 [2022-04-18 20:33:58,112 INFO L226 Difference]: Without dead ends: 21704 [2022-04-18 20:33:58,112 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:33:58,113 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 41 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:33:58,113 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 193 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 132 Unchecked, 0.0s Time] [2022-04-18 20:33:58,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21704 states. [2022-04-18 20:33:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21704 to 21332. [2022-04-18 20:33:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21332 states, 21327 states have (on average 4.087400947156187) internal successors, (87172), 21331 states have internal predecessors, (87172), 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 20:33:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21332 states to 21332 states and 87172 transitions. [2022-04-18 20:33:58,480 INFO L78 Accepts]: Start accepts. Automaton has 21332 states and 87172 transitions. Word has length 22 [2022-04-18 20:33:58,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:33:58,481 INFO L478 AbstractCegarLoop]: Abstraction has 21332 states and 87172 transitions. [2022-04-18 20:33:58,481 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:33:58,481 INFO L276 IsEmpty]: Start isEmpty. Operand 21332 states and 87172 transitions. [2022-04-18 20:33:58,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:33:58,491 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:33:58,491 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, 1] [2022-04-18 20:33:58,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (76)] Forceful destruction successful, exit code 0 [2022-04-18 20:33:58,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:33:58,699 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:33:58,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:33:58,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2003986479, now seen corresponding path program 2 times [2022-04-18 20:33:58,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:33:58,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234620405] [2022-04-18 20:33:58,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 20:33:58,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:33:58,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:33:58,701 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:33:58,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (77)] Waiting until timeout for monitored process [2022-04-18 20:33:59,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 20:33:59,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:33:59,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:33:59,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:33:59,276 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 11 treesize of output 7 [2022-04-18 20:33:59,390 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:33:59,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:33:59,443 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:33:59,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:33:59,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:33:59,556 INFO L356 Elim1Store]: treesize reduction 315, result has 10.3 percent of original size [2022-04-18 20:33:59,557 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 88 [2022-04-18 20:33:59,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:33:59,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:33:59,589 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:33:59,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 78 [2022-04-18 20:33:59,685 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:33:59,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:33:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:33:59,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:33:59,921 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 1))) (~A~0.offset (_ BitVec 32))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse0 ~A~0.offset) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_5333) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) (forall ((thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 1))) (~A~0.offset (_ BitVec 32))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse1 ~A~0.offset) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_5333) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) (forall ((thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 1))) (~A~0.offset (_ BitVec 32))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse2 ~A~0.offset) (_ bv0 1)) (bvadd .cse2 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse2 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse2 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_5333) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)) (_ bv0 1)))) is different from false [2022-04-18 20:34:10,454 INFO L356 Elim1Store]: treesize reduction 1266, result has 6.0 percent of original size [2022-04-18 20:34:10,454 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 84 treesize of output 93 [2022-04-18 20:34:10,466 INFO L356 Elim1Store]: treesize reduction 342, result has 0.3 percent of original size [2022-04-18 20:34:10,466 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 106 treesize of output 49 [2022-04-18 20:34:10,726 INFO L356 Elim1Store]: treesize reduction 1346, result has 0.1 percent of original size [2022-04-18 20:34:10,727 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 82 treesize of output 1 [2022-04-18 20:34:11,003 INFO L356 Elim1Store]: treesize reduction 1346, result has 0.1 percent of original size [2022-04-18 20:34:11,003 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 84 treesize of output 1 [2022-04-18 20:34:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-04-18 20:34:11,573 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:34:11,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234620405] [2022-04-18 20:34:11,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234620405] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:34:11,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1868489604] [2022-04-18 20:34:11,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 20:34:11,574 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-04-18 20:34:11,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 [2022-04-18 20:34:11,575 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-04-18 20:34:11,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (78)] Waiting until timeout for monitored process [2022-04-18 20:34:12,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 20:34:12,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:34:12,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-18 20:34:12,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:34:12,068 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 20 treesize of output 18 [2022-04-18 20:34:12,778 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 11 treesize of output 7 [2022-04-18 20:34:12,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:34:12,920 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 21 treesize of output 20 [2022-04-18 20:34:12,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:34:12,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:34:12,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:34:12,991 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:34:12,991 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 1 case distinctions, treesize of input 30 treesize of output 32 [2022-04-18 20:34:13,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:34:13,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:34:13,092 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:34:13,092 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 1 case distinctions, treesize of input 35 treesize of output 39 [2022-04-18 20:34:13,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:34:13,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:34:13,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:34:13,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:34:13,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:34:13,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:34:13,501 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:34:13,501 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 3 case distinctions, treesize of input 39 treesize of output 44 [2022-04-18 20:34:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:34:13,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:34:13,872 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5408 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5409 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_5409) c_~C~0.base v_ArrVal_5408) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (forall ((v_ArrVal_5408 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5409 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_5409) c_~C~0.base v_ArrVal_5408) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) (forall ((v_ArrVal_5408 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5409 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_5409) c_~C~0.base v_ArrVal_5408) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))))) is different from false [2022-04-18 20:34:13,890 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5408 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5409 (Array (_ BitVec 32) (_ BitVec 1)))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5409) c_~C~0.base v_ArrVal_5408) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)) (_ bv0 1))) (forall ((v_ArrVal_5408 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5409 (Array (_ BitVec 32) (_ BitVec 1)))) (= (let ((.cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 (_ bv0 1))) c_~A~0.base v_ArrVal_5409) c_~C~0.base v_ArrVal_5408) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) (_ bv0 1))) (forall ((v_ArrVal_5408 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5409 (Array (_ BitVec 32) (_ BitVec 1)))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5409) c_~C~0.base v_ArrVal_5408) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1)))) is different from false [2022-04-18 20:34:13,909 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5408 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5409 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5409) c_~C~0.base v_ArrVal_5408) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (forall ((v_ArrVal_5408 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5409 (Array (_ BitVec 32) (_ BitVec 1)))) (= (let ((.cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1)) .cse0 (_ bv0 1))) c_~A~0.base v_ArrVal_5409) c_~C~0.base v_ArrVal_5408) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) (_ bv0 1))) (forall ((v_ArrVal_5408 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5409 (Array (_ BitVec 32) (_ BitVec 1)))) (= (let ((.cse1 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5409) c_~C~0.base v_ArrVal_5408) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) (_ bv0 1)))) is different from false [2022-04-18 20:34:13,947 INFO L356 Elim1Store]: treesize reduction 72, result has 30.1 percent of original size [2022-04-18 20:34:13,947 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 33 treesize of output 46 [2022-04-18 20:34:13,953 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-04-18 20:34:13,953 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 160 treesize of output 132 [2022-04-18 20:34:13,959 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 59 treesize of output 51 [2022-04-18 20:34:13,961 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 110 treesize of output 94 [2022-04-18 20:34:14,024 INFO L356 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-04-18 20:34:14,024 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 3 case distinctions, treesize of input 31 treesize of output 1 [2022-04-18 20:34:14,034 INFO L356 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-04-18 20:34:14,034 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 3 case distinctions, treesize of input 33 treesize of output 1 [2022-04-18 20:34:14,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-04-18 20:34:14,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1868489604] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:34:14,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979327252] [2022-04-18 20:34:14,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 20:34:14,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:34:14,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:34:14,987 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:34:14,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-04-18 20:34:15,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 20:34:15,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:34:15,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-18 20:34:15,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:34:15,346 INFO L356 Elim1Store]: treesize reduction 88, result has 24.8 percent of original size [2022-04-18 20:34:15,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 58 [2022-04-18 20:34:16,033 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:34:16,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-04-18 20:34:16,481 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-18 20:34:16,586 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:34:16,587 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 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:34:16,681 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:34:16,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:34:16,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-04-18 20:34:16,800 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:34:16,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:34:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:34:16,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:34:16,897 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5487 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5488 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_5488) c_~C~0.base v_ArrVal_5487) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) (forall ((v_ArrVal_5487 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5488 (Array (_ BitVec 32) (_ BitVec 1)))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_5488) c_~C~0.base v_ArrVal_5487) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)) (_ bv0 1))) (forall ((v_ArrVal_5487 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5488 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_5488) c_~C~0.base v_ArrVal_5487) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) is different from false [2022-04-18 20:34:16,911 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5487 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5488 (Array (_ BitVec 32) (_ BitVec 1)))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5488) c_~C~0.base v_ArrVal_5487) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)) (_ bv0 1))) (forall ((v_ArrVal_5487 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5488 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (let ((.cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 (_ bv0 1))) c_~A~0.base v_ArrVal_5488) c_~C~0.base v_ArrVal_5487) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)))) (forall ((v_ArrVal_5487 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5488 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5488) c_~C~0.base v_ArrVal_5487) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) is different from false [2022-04-18 20:34:16,932 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5487 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5488 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5488) c_~C~0.base v_ArrVal_5487) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (forall ((v_ArrVal_5487 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5488 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (let ((.cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1)) .cse0 (_ bv0 1))) c_~A~0.base v_ArrVal_5488) c_~C~0.base v_ArrVal_5487) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)))) (forall ((v_ArrVal_5487 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5488 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (let ((.cse1 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5488) c_~C~0.base v_ArrVal_5487) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1))))) is different from false [2022-04-18 20:34:16,966 INFO L356 Elim1Store]: treesize reduction 73, result has 29.1 percent of original size [2022-04-18 20:34:16,966 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 33 treesize of output 45 [2022-04-18 20:34:16,971 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-04-18 20:34:16,971 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 159 treesize of output 131 [2022-04-18 20:34:16,975 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 59 treesize of output 51 [2022-04-18 20:34:16,977 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 110 treesize of output 94 [2022-04-18 20:34:17,013 INFO L356 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-04-18 20:34:17,014 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 3 case distinctions, treesize of input 31 treesize of output 1 [2022-04-18 20:34:17,038 INFO L356 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-04-18 20:34:17,039 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 3 case distinctions, treesize of input 33 treesize of output 1 [2022-04-18 20:34:17,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-04-18 20:34:17,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979327252] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:34:17,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-04-18 20:34:17,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 40 [2022-04-18 20:34:17,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776071205] [2022-04-18 20:34:17,426 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-04-18 20:34:17,426 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-18 20:34:17,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:34:17,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-18 20:34:17,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1016, Unknown=15, NotChecked=504, Total=1722 [2022-04-18 20:34:17,427 INFO L87 Difference]: Start difference. First operand 21332 states and 87172 transitions. Second operand has 42 states, 41 states have (on average 2.6097560975609757) internal successors, (107), 41 states have internal predecessors, (107), 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 20:34:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:34:23,813 INFO L93 Difference]: Finished difference Result 21550 states and 88153 transitions. [2022-04-18 20:34:23,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:34:23,814 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.6097560975609757) internal successors, (107), 41 states have internal predecessors, (107), 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 22 [2022-04-18 20:34:23,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:34:23,874 INFO L225 Difference]: With dead ends: 21550 [2022-04-18 20:34:23,874 INFO L226 Difference]: Without dead ends: 21550 [2022-04-18 20:34:23,874 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=281, Invalid=1451, Unknown=18, NotChecked=602, Total=2352 [2022-04-18 20:34:23,875 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 83 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 438 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:34:23,875 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 483 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 144 Invalid, 0 Unknown, 438 Unchecked, 0.2s Time] [2022-04-18 20:34:23,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21550 states. [2022-04-18 20:34:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21550 to 21292. [2022-04-18 20:34:24,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21292 states, 21287 states have (on average 4.087189364400808) internal successors, (87004), 21291 states have internal predecessors, (87004), 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 20:34:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21292 states to 21292 states and 87004 transitions. [2022-04-18 20:34:24,506 INFO L78 Accepts]: Start accepts. Automaton has 21292 states and 87004 transitions. Word has length 22 [2022-04-18 20:34:24,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:34:24,507 INFO L478 AbstractCegarLoop]: Abstraction has 21292 states and 87004 transitions. [2022-04-18 20:34:24,507 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.6097560975609757) internal successors, (107), 41 states have internal predecessors, (107), 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 20:34:24,507 INFO L276 IsEmpty]: Start isEmpty. Operand 21292 states and 87004 transitions. [2022-04-18 20:34:24,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:34:24,520 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:34:24,521 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, 1] [2022-04-18 20:34:24,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (78)] Forceful destruction successful, exit code 0 [2022-04-18 20:34:24,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (77)] Forceful destruction successful, exit code 0 [2022-04-18 20:34:24,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2022-04-18 20:34:25,125 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 78 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt,77 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3,79 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:34:25,126 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:34:25,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:34:25,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1932595087, now seen corresponding path program 3 times [2022-04-18 20:34:25,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:34:25,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686781366] [2022-04-18 20:34:25,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:34:25,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:34:25,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:34:25,128 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:34:25,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (80)] Waiting until timeout for monitored process [2022-04-18 20:34:25,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-18 20:34:25,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:34:25,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:34:25,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:34:25,586 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 11 treesize of output 7 [2022-04-18 20:34:25,632 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:34:25,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:34:25,684 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:34:25,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:34:25,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:34:25,813 INFO L356 Elim1Store]: treesize reduction 313, result has 10.8 percent of original size [2022-04-18 20:34:25,813 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 90 [2022-04-18 20:34:25,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:34:25,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:34:25,847 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:34:25,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 80 [2022-04-18 20:34:25,977 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:34:25,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:34:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:34:26,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:34:26,193 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (v_ArrVal_5563 (Array (_ BitVec 32) (_ BitVec 1))) (~A~0.offset (_ BitVec 32))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse0 ~A~0.offset) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_5563) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) (forall ((thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (v_ArrVal_5563 (Array (_ BitVec 32) (_ BitVec 1))) (~A~0.offset (_ BitVec 32))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse1 ~A~0.offset) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_5563) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)) (_ bv0 1))) (forall ((thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (v_ArrVal_5563 (Array (_ BitVec 32) (_ BitVec 1))) (~A~0.offset (_ BitVec 32))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse2 ~A~0.offset) (_ bv0 1)) (bvadd .cse2 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse2 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse2 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_5563) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1)))) is different from false [2022-04-18 20:34:49,030 WARN L232 SmtUtils]: Spent 14.74s on a formula simplification. DAG size of input: 125 DAG size of output: 42 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-04-18 20:34:49,030 INFO L356 Elim1Store]: treesize reduction 1264, result has 6.2 percent of original size [2022-04-18 20:34:49,030 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 84 treesize of output 95 [2022-04-18 20:34:49,039 INFO L356 Elim1Store]: treesize reduction 342, result has 0.3 percent of original size [2022-04-18 20:34:49,039 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 108 treesize of output 51 [2022-04-18 20:34:49,044 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 20:34:49,417 INFO L356 Elim1Store]: treesize reduction 1346, result has 0.1 percent of original size [2022-04-18 20:34:49,417 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 82 treesize of output 1 [2022-04-18 20:35:03,714 WARN L232 SmtUtils]: Spent 14.29s on a formula simplification. DAG size of input: 125 DAG size of output: 1 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-04-18 20:35:03,714 INFO L356 Elim1Store]: treesize reduction 1346, result has 0.1 percent of original size [2022-04-18 20:35:03,715 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 84 treesize of output 1 [2022-04-18 20:35:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-04-18 20:35:04,606 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:35:04,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686781366] [2022-04-18 20:35:04,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686781366] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:35:04,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1547899827] [2022-04-18 20:35:04,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:35:04,607 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-04-18 20:35:04,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 [2022-04-18 20:35:04,608 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-04-18 20:35:04,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (81)] Waiting until timeout for monitored process [2022-04-18 20:35:05,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-18 20:35:05,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:35:05,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-18 20:35:05,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:35:05,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:05,102 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 106 treesize of output 102 [2022-04-18 20:35:06,083 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 11 treesize of output 7 [2022-04-18 20:35:06,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:06,272 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 21 treesize of output 20 [2022-04-18 20:35:06,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:06,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:06,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:06,351 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:35:06,351 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 1 case distinctions, treesize of input 30 treesize of output 32 [2022-04-18 20:35:06,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:06,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:06,455 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:35:06,456 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 1 case distinctions, treesize of input 35 treesize of output 39 [2022-04-18 20:35:06,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:06,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:06,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:06,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:06,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:06,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:06,848 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:35:06,848 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 3 case distinctions, treesize of input 39 treesize of output 44 [2022-04-18 20:35:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:35:07,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:35:07,418 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5641 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5642 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_5642) c_~C~0.base v_ArrVal_5641) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (forall ((v_ArrVal_5641 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5642 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_5642) c_~C~0.base v_ArrVal_5641) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) (forall ((v_ArrVal_5641 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5642 (Array (_ BitVec 32) (_ BitVec 1)))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_5642) c_~C~0.base v_ArrVal_5641) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)) (_ bv0 1)))) is different from false [2022-04-18 20:35:07,437 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5641 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5642 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (let ((.cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 (_ bv0 1))) c_~A~0.base v_ArrVal_5642) c_~C~0.base v_ArrVal_5641) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)))) (forall ((v_ArrVal_5641 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5642 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5642) c_~C~0.base v_ArrVal_5641) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) (forall ((v_ArrVal_5641 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5642 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5642) c_~C~0.base v_ArrVal_5641) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) is different from false [2022-04-18 20:35:07,457 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5641 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5642 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5642) c_~C~0.base v_ArrVal_5641) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (forall ((v_ArrVal_5641 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5642 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (let ((.cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1)) .cse0 (_ bv0 1))) c_~A~0.base v_ArrVal_5642) c_~C~0.base v_ArrVal_5641) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)))) (forall ((v_ArrVal_5641 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5642 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (let ((.cse1 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5642) c_~C~0.base v_ArrVal_5641) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1))))) is different from false [2022-04-18 20:35:07,503 INFO L356 Elim1Store]: treesize reduction 73, result has 29.1 percent of original size [2022-04-18 20:35:07,503 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 33 treesize of output 45 [2022-04-18 20:35:07,511 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-04-18 20:35:07,511 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 159 treesize of output 131 [2022-04-18 20:35:07,517 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 105 treesize of output 89 [2022-04-18 20:35:07,521 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 50 treesize of output 42 [2022-04-18 20:35:07,610 INFO L356 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-04-18 20:35:07,610 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 3 case distinctions, treesize of input 31 treesize of output 1 [2022-04-18 20:35:07,625 INFO L356 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-04-18 20:35:07,625 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 3 case distinctions, treesize of input 33 treesize of output 1 [2022-04-18 20:35:08,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-04-18 20:35:08,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1547899827] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:35:08,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90246141] [2022-04-18 20:35:08,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:35:08,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:35:08,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:35:08,529 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:35:08,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-04-18 20:35:08,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-18 20:35:08,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:35:08,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-18 20:35:08,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:35:08,882 INFO L356 Elim1Store]: treesize reduction 88, result has 24.8 percent of original size [2022-04-18 20:35:08,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 58 [2022-04-18 20:35:09,321 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:35:09,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-04-18 20:35:10,230 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-18 20:35:10,428 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:35:10,428 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 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:35:10,556 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:35:10,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:35:10,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-04-18 20:35:10,723 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:35:10,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:35:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:35:10,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:35:10,834 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5721 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5722 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_5722) c_~C~0.base v_ArrVal_5721) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) (forall ((v_ArrVal_5721 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5722 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_5722) c_~C~0.base v_ArrVal_5721) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) (forall ((v_ArrVal_5721 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5722 (Array (_ BitVec 32) (_ BitVec 1)))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_5722) c_~C~0.base v_ArrVal_5721) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1)))) is different from false [2022-04-18 20:35:10,853 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5721 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5722 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5722) c_~C~0.base v_ArrVal_5721) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (forall ((v_ArrVal_5721 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5722 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (let ((.cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 (_ bv0 1))) c_~A~0.base v_ArrVal_5722) c_~C~0.base v_ArrVal_5721) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)))) (forall ((v_ArrVal_5721 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5722 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5722) c_~C~0.base v_ArrVal_5721) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))))) is different from false [2022-04-18 20:35:10,875 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5721 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5722 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5722) c_~C~0.base v_ArrVal_5721) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (forall ((v_ArrVal_5721 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5722 (Array (_ BitVec 32) (_ BitVec 1)))) (= (let ((.cse0 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5722) c_~C~0.base v_ArrVal_5721) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) (_ bv0 1))) (forall ((v_ArrVal_5721 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5722 (Array (_ BitVec 32) (_ BitVec 1)))) (= (let ((.cse1 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1)) .cse1 (_ bv0 1))) c_~A~0.base v_ArrVal_5722) c_~C~0.base v_ArrVal_5721) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) (_ bv0 1)))) is different from false [2022-04-18 20:35:10,919 INFO L356 Elim1Store]: treesize reduction 72, result has 30.1 percent of original size [2022-04-18 20:35:10,919 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 31 treesize of output 44 [2022-04-18 20:35:10,924 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-04-18 20:35:10,925 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 82 treesize of output 62 [2022-04-18 20:35:10,929 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 48 treesize of output 44 [2022-04-18 20:35:10,932 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 22 treesize of output 20 [2022-04-18 20:35:10,979 INFO L356 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-04-18 20:35:10,979 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 3 case distinctions, treesize of input 33 treesize of output 1 [2022-04-18 20:35:10,990 INFO L356 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-04-18 20:35:10,991 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 3 case distinctions, treesize of input 33 treesize of output 1 [2022-04-18 20:35:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-04-18 20:35:11,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90246141] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:35:11,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-04-18 20:35:11,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 40 [2022-04-18 20:35:11,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483147879] [2022-04-18 20:35:11,228 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-04-18 20:35:11,228 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-18 20:35:11,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:35:11,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-18 20:35:11,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1016, Unknown=15, NotChecked=504, Total=1722 [2022-04-18 20:35:11,228 INFO L87 Difference]: Start difference. First operand 21292 states and 87004 transitions. Second operand has 42 states, 41 states have (on average 2.6097560975609757) internal successors, (107), 41 states have internal predecessors, (107), 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 20:35:19,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:35:19,710 INFO L93 Difference]: Finished difference Result 21678 states and 88801 transitions. [2022-04-18 20:35:19,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:35:19,711 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.6097560975609757) internal successors, (107), 41 states have internal predecessors, (107), 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 22 [2022-04-18 20:35:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:35:19,770 INFO L225 Difference]: With dead ends: 21678 [2022-04-18 20:35:19,770 INFO L226 Difference]: Without dead ends: 21678 [2022-04-18 20:35:19,771 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=281, Invalid=1450, Unknown=19, NotChecked=602, Total=2352 [2022-04-18 20:35:19,771 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 119 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:35:19,771 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 399 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 389 Unchecked, 0.1s Time] [2022-04-18 20:35:19,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21678 states. [2022-04-18 20:35:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21678 to 21340. [2022-04-18 20:35:20,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21340 states, 21335 states have (on average 4.089946097961096) internal successors, (87259), 21339 states have internal predecessors, (87259), 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 20:35:20,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21340 states to 21340 states and 87259 transitions. [2022-04-18 20:35:20,171 INFO L78 Accepts]: Start accepts. Automaton has 21340 states and 87259 transitions. Word has length 22 [2022-04-18 20:35:20,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:35:20,171 INFO L478 AbstractCegarLoop]: Abstraction has 21340 states and 87259 transitions. [2022-04-18 20:35:20,171 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.6097560975609757) internal successors, (107), 41 states have internal predecessors, (107), 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 20:35:20,172 INFO L276 IsEmpty]: Start isEmpty. Operand 21340 states and 87259 transitions. [2022-04-18 20:35:20,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:35:20,182 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:35:20,182 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, 1] [2022-04-18 20:35:20,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2022-04-18 20:35:20,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (80)] Forceful destruction successful, exit code 0 [2022-04-18 20:35:20,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (81)] Ended with exit code 0 [2022-04-18 20:35:20,803 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 82 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,80 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3,81 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt [2022-04-18 20:35:20,803 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:35:20,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:35:20,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1929369847, now seen corresponding path program 4 times [2022-04-18 20:35:20,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:35:20,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34616108] [2022-04-18 20:35:20,804 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:35:20,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:35:20,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:35:20,987 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:35:21,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (83)] Waiting until timeout for monitored process [2022-04-18 20:35:21,337 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:35:21,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:35:21,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:35:21,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:35:21,593 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 11 treesize of output 7 [2022-04-18 20:35:21,643 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:35:21,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:35:21,735 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:35:21,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:35:21,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:21,917 INFO L356 Elim1Store]: treesize reduction 314, result has 10.5 percent of original size [2022-04-18 20:35:21,918 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 89 [2022-04-18 20:35:21,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:21,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:21,968 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:35:21,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 79 [2022-04-18 20:35:22,280 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:35:22,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:35:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:35:22,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:35:22,545 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5792 (Array (_ BitVec 32) (_ BitVec 1))) (thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (~A~0.offset (_ BitVec 32))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse0 ~A~0.offset) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_5792) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (forall ((v_ArrVal_5792 (Array (_ BitVec 32) (_ BitVec 1))) (thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (~A~0.offset (_ BitVec 32))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse1 ~A~0.offset) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_5792) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) (forall ((v_ArrVal_5792 (Array (_ BitVec 32) (_ BitVec 1))) (thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (~A~0.offset (_ BitVec 32))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse2 ~A~0.offset) (_ bv0 1)) (bvadd .cse2 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse2 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse2 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_5792) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))))) is different from false [2022-04-18 20:35:41,379 WARN L232 SmtUtils]: Spent 8.57s on a formula simplification. DAG size of input: 125 DAG size of output: 42 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-04-18 20:35:41,379 INFO L356 Elim1Store]: treesize reduction 1264, result has 6.2 percent of original size [2022-04-18 20:35:41,380 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 85 treesize of output 96 [2022-04-18 20:35:41,391 INFO L356 Elim1Store]: treesize reduction 342, result has 0.3 percent of original size [2022-04-18 20:35:41,392 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 110 treesize of output 53 [2022-04-18 20:35:41,776 INFO L356 Elim1Store]: treesize reduction 1346, result has 0.1 percent of original size [2022-04-18 20:35:41,777 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 83 treesize of output 1 [2022-04-18 20:35:42,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-04-18 20:35:42,318 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:35:42,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34616108] [2022-04-18 20:35:42,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34616108] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:35:42,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2001752658] [2022-04-18 20:35:42,318 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:35:42,318 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-04-18 20:35:42,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 [2022-04-18 20:35:42,319 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-04-18 20:35:42,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (84)] Waiting until timeout for monitored process [2022-04-18 20:35:42,804 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:35:42,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:35:42,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-18 20:35:42,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:35:42,821 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 114 treesize of output 110 [2022-04-18 20:35:43,542 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 11 treesize of output 7 [2022-04-18 20:35:43,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:43,693 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 21 treesize of output 20 [2022-04-18 20:35:43,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:43,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:43,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:43,812 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:35:43,812 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 1 case distinctions, treesize of input 30 treesize of output 32 [2022-04-18 20:35:43,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:43,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:43,974 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:35:43,975 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 1 case distinctions, treesize of input 35 treesize of output 39 [2022-04-18 20:35:44,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:44,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:44,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:44,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:44,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:44,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:44,299 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:35:44,299 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 3 case distinctions, treesize of input 39 treesize of output 44 [2022-04-18 20:35:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:35:44,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:35:44,779 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5874 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5875 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_5875) c_~C~0.base v_ArrVal_5874) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) (forall ((v_ArrVal_5874 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5875 (Array (_ BitVec 32) (_ BitVec 1)))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_5875) c_~C~0.base v_ArrVal_5874) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)) (_ bv0 1))) (forall ((v_ArrVal_5874 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5875 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_5875) c_~C~0.base v_ArrVal_5874) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) is different from false [2022-04-18 20:35:44,804 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5874 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5875 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5875) c_~C~0.base v_ArrVal_5874) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (forall ((v_ArrVal_5874 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5875 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (let ((.cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 (_ bv0 1))) c_~A~0.base v_ArrVal_5875) c_~C~0.base v_ArrVal_5874) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)))) (forall ((v_ArrVal_5874 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5875 (Array (_ BitVec 32) (_ BitVec 1)))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5875) c_~C~0.base v_ArrVal_5874) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)) (_ bv0 1)))) is different from false [2022-04-18 20:35:44,830 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5874 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5875 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (let ((.cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1)) .cse0 (_ bv0 1))) c_~A~0.base v_ArrVal_5875) c_~C~0.base v_ArrVal_5874) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)))) (forall ((v_ArrVal_5874 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5875 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (let ((.cse1 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5875) c_~C~0.base v_ArrVal_5874) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)))) (forall ((v_ArrVal_5874 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5875 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5875) c_~C~0.base v_ArrVal_5874) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) is different from false [2022-04-18 20:35:44,897 INFO L356 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2022-04-18 20:35:44,898 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 33 treesize of output 44 [2022-04-18 20:35:44,906 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-04-18 20:35:44,906 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 88 treesize of output 66 [2022-04-18 20:35:44,912 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 20:35:44,916 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 44 treesize of output 36 [2022-04-18 20:35:44,983 INFO L356 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-04-18 20:35:44,984 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 3 case distinctions, treesize of input 33 treesize of output 1 [2022-04-18 20:35:45,002 INFO L356 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-04-18 20:35:45,002 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 3 case distinctions, treesize of input 31 treesize of output 1 [2022-04-18 20:35:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-04-18 20:35:45,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2001752658] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:35:45,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899662947] [2022-04-18 20:35:45,709 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:35:45,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:35:45,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:35:45,710 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:35:45,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-04-18 20:35:45,988 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:35:45,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:35:45,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-18 20:35:45,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:35:46,058 INFO L356 Elim1Store]: treesize reduction 108, result has 18.8 percent of original size [2022-04-18 20:35:46,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 59 treesize of output 67 [2022-04-18 20:35:46,403 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 20:35:46,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2022-04-18 20:35:46,496 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-18 20:35:46,925 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:35:46,925 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 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:35:47,116 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:35:47,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:35:47,273 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:35:47,273 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 1 case distinctions, treesize of input 35 treesize of output 39 [2022-04-18 20:35:47,393 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:35:47,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:35:47,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:35:47,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:35:47,502 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5955 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5956 (Array (_ BitVec 32) (_ BitVec 1)))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_5956) c_~C~0.base v_ArrVal_5955) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)) (_ bv0 1))) (forall ((v_ArrVal_5955 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5956 (Array (_ BitVec 32) (_ BitVec 1)))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_5956) c_~C~0.base v_ArrVal_5955) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)) (_ bv0 1))) (forall ((v_ArrVal_5955 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5956 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_5956) c_~C~0.base v_ArrVal_5955) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) is different from false [2022-04-18 20:35:47,527 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5955 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5956 (Array (_ BitVec 32) (_ BitVec 1)))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5956) c_~C~0.base v_ArrVal_5955) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)) (_ bv0 1))) (forall ((v_ArrVal_5955 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5956 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (let ((.cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 (_ bv0 1))) c_~A~0.base v_ArrVal_5956) c_~C~0.base v_ArrVal_5955) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)))) (forall ((v_ArrVal_5955 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5956 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5956) c_~C~0.base v_ArrVal_5955) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) is different from false [2022-04-18 20:35:47,553 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5955 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5956 (Array (_ BitVec 32) (_ BitVec 1)))) (= (let ((.cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1)) .cse0 (_ bv0 1))) c_~A~0.base v_ArrVal_5956) c_~C~0.base v_ArrVal_5955) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) (_ bv0 1))) (forall ((v_ArrVal_5955 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5956 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (let ((.cse1 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5956) c_~C~0.base v_ArrVal_5955) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)))) (forall ((v_ArrVal_5955 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_5956 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1)) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_5956) c_~C~0.base v_ArrVal_5955) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) is different from false [2022-04-18 20:35:47,623 INFO L356 Elim1Store]: treesize reduction 71, result has 31.1 percent of original size [2022-04-18 20:35:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 47 [2022-04-18 20:35:47,631 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-04-18 20:35:47,632 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 161 treesize of output 133 [2022-04-18 20:35:47,639 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 118 treesize of output 102 [2022-04-18 20:35:47,644 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 55 treesize of output 47 [2022-04-18 20:35:47,720 INFO L356 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-04-18 20:35:47,721 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 3 case distinctions, treesize of input 31 treesize of output 1 [2022-04-18 20:35:47,732 INFO L356 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-04-18 20:35:47,732 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 3 case distinctions, treesize of input 33 treesize of output 1 [2022-04-18 20:35:48,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-04-18 20:35:48,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899662947] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:35:48,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-04-18 20:35:48,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 38 [2022-04-18 20:35:48,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653794495] [2022-04-18 20:35:48,113 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-04-18 20:35:48,113 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-18 20:35:48,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:35:48,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-18 20:35:48,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=877, Unknown=19, NotChecked=476, Total=1560 [2022-04-18 20:35:48,114 INFO L87 Difference]: Start difference. First operand 21340 states and 87259 transitions. Second operand has 40 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 39 states have internal predecessors, (97), 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 20:35:51,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:35:51,281 INFO L93 Difference]: Finished difference Result 22044 states and 90412 transitions. [2022-04-18 20:35:51,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-18 20:35:51,282 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 39 states have internal predecessors, (97), 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 22 [2022-04-18 20:35:51,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:35:51,470 INFO L225 Difference]: With dead ends: 22044 [2022-04-18 20:35:51,470 INFO L226 Difference]: Without dead ends: 22044 [2022-04-18 20:35:51,471 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 7 IntricatePredicates, 3 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=268, Invalid=1147, Unknown=19, NotChecked=546, Total=1980 [2022-04-18 20:35:51,472 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 108 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 578 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:35:51,472 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 383 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 578 Unchecked, 0.2s Time] [2022-04-18 20:35:51,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22044 states. [2022-04-18 20:35:51,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22044 to 21392. [2022-04-18 20:35:51,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21392 states, 21387 states have (on average 4.089119558610371) internal successors, (87454), 21391 states have internal predecessors, (87454), 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 20:35:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21392 states to 21392 states and 87454 transitions. [2022-04-18 20:35:51,946 INFO L78 Accepts]: Start accepts. Automaton has 21392 states and 87454 transitions. Word has length 22 [2022-04-18 20:35:51,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:35:51,947 INFO L478 AbstractCegarLoop]: Abstraction has 21392 states and 87454 transitions. [2022-04-18 20:35:51,947 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 39 states have internal predecessors, (97), 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 20:35:51,947 INFO L276 IsEmpty]: Start isEmpty. Operand 21392 states and 87454 transitions. [2022-04-18 20:35:51,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:35:51,957 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:35:51,957 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:35:51,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (84)] Forceful destruction successful, exit code 0 [2022-04-18 20:35:52,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2022-04-18 20:35:52,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (83)] Forceful destruction successful, exit code 0 [2022-04-18 20:35:52,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 84 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt,85 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,83 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:35:52,563 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:35:52,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:35:52,564 INFO L85 PathProgramCache]: Analyzing trace with hash 149363121, now seen corresponding path program 7 times [2022-04-18 20:35:52,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:35:52,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133514464] [2022-04-18 20:35:52,564 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-18 20:35:52,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:35:52,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:35:52,566 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:35:52,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (86)] Waiting until timeout for monitored process [2022-04-18 20:35:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:35:52,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-18 20:35:52,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:35:53,156 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 11 treesize of output 7 [2022-04-18 20:35:53,217 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:35:53,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:35:53,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:53,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:53,384 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:35:53,384 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 1 case distinctions, treesize of input 26 treesize of output 32 [2022-04-18 20:35:53,502 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:35:53,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:35:53,639 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:35:53,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:35:53,745 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 20:35:53,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:35:53,745 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:35:53,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133514464] [2022-04-18 20:35:53,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133514464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:35:53,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:35:53,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:35:53,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573050126] [2022-04-18 20:35:53,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:35:53,746 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:35:53,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:35:53,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:35:53,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:35:53,746 INFO L87 Difference]: Start difference. First operand 21392 states and 87454 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:35:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:35:54,115 INFO L93 Difference]: Finished difference Result 21664 states and 88622 transitions. [2022-04-18 20:35:54,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:35:54,117 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:35:54,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:35:54,194 INFO L225 Difference]: With dead ends: 21664 [2022-04-18 20:35:54,195 INFO L226 Difference]: Without dead ends: 21664 [2022-04-18 20:35:54,195 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:35:54,195 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 42 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:35:54,195 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 187 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 73 Unchecked, 0.1s Time] [2022-04-18 20:35:54,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21664 states. [2022-04-18 20:35:54,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21664 to 21512. [2022-04-18 20:35:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21512 states, 21507 states have (on average 4.08973822476403) internal successors, (87958), 21511 states have internal predecessors, (87958), 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 20:35:54,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21512 states to 21512 states and 87958 transitions. [2022-04-18 20:35:54,686 INFO L78 Accepts]: Start accepts. Automaton has 21512 states and 87958 transitions. Word has length 22 [2022-04-18 20:35:54,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:35:54,686 INFO L478 AbstractCegarLoop]: Abstraction has 21512 states and 87958 transitions. [2022-04-18 20:35:54,686 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:35:54,687 INFO L276 IsEmpty]: Start isEmpty. Operand 21512 states and 87958 transitions. [2022-04-18 20:35:54,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:35:54,699 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:35:54,699 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:35:54,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (86)] Ended with exit code 0 [2022-04-18 20:35:54,903 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:35:54,903 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:35:54,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:35:54,904 INFO L85 PathProgramCache]: Analyzing trace with hash 149641191, now seen corresponding path program 8 times [2022-04-18 20:35:54,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:35:54,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335140872] [2022-04-18 20:35:54,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 20:35:54,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:35:54,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:35:54,905 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:35:54,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (87)] Waiting until timeout for monitored process [2022-04-18 20:35:55,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-18 20:35:55,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:35:55,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-18 20:35:55,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:35:55,458 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 11 treesize of output 7 [2022-04-18 20:35:55,528 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:35:55,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:35:55,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:55,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:55,694 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:35:55,694 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 1 case distinctions, treesize of input 26 treesize of output 32 [2022-04-18 20:35:55,815 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:35:55,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:35:55,969 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:35:55,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:35:56,056 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 20:35:56,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:35:56,057 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:35:56,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335140872] [2022-04-18 20:35:56,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335140872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:35:56,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:35:56,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:35:56,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855938065] [2022-04-18 20:35:56,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:35:56,057 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:35:56,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:35:56,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:35:56,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:35:56,057 INFO L87 Difference]: Start difference. First operand 21512 states and 87958 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:35:56,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:35:56,384 INFO L93 Difference]: Finished difference Result 21862 states and 89511 transitions. [2022-04-18 20:35:56,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:35:56,385 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:35:56,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:35:56,456 INFO L225 Difference]: With dead ends: 21862 [2022-04-18 20:35:56,456 INFO L226 Difference]: Without dead ends: 21862 [2022-04-18 20:35:56,457 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:35:56,457 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:35:56,457 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 193 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 96 Unchecked, 0.1s Time] [2022-04-18 20:35:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21862 states. [2022-04-18 20:35:56,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21862 to 21512. [2022-04-18 20:35:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21512 states, 21507 states have (on average 4.08973822476403) internal successors, (87958), 21511 states have internal predecessors, (87958), 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 20:35:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21512 states to 21512 states and 87958 transitions. [2022-04-18 20:35:56,943 INFO L78 Accepts]: Start accepts. Automaton has 21512 states and 87958 transitions. Word has length 22 [2022-04-18 20:35:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:35:56,943 INFO L478 AbstractCegarLoop]: Abstraction has 21512 states and 87958 transitions. [2022-04-18 20:35:56,943 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:35:56,944 INFO L276 IsEmpty]: Start isEmpty. Operand 21512 states and 87958 transitions. [2022-04-18 20:35:56,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:35:56,954 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:35:56,954 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:35:56,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (87)] Ended with exit code 0 [2022-04-18 20:35:57,161 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 87 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:35:57,162 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:35:57,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:35:57,162 INFO L85 PathProgramCache]: Analyzing trace with hash 161432661, now seen corresponding path program 9 times [2022-04-18 20:35:57,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:35:57,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080430573] [2022-04-18 20:35:57,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:35:57,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:35:57,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:35:57,163 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:35:57,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (88)] Waiting until timeout for monitored process [2022-04-18 20:35:57,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:35:57,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:35:57,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:35:57,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:35:57,861 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 11 treesize of output 7 [2022-04-18 20:35:57,945 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:35:57,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:35:58,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:58,164 INFO L356 Elim1Store]: treesize reduction 292, result has 11.2 percent of original size [2022-04-18 20:35:58,164 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 77 [2022-04-18 20:35:58,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:58,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:35:58,219 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:35:58,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 72 [2022-04-18 20:35:58,376 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:35:58,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:35:58,513 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:35:58,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:35:58,591 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 20:35:58,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:35:58,591 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:35:58,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080430573] [2022-04-18 20:35:58,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080430573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:35:58,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:35:58,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:35:58,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175783801] [2022-04-18 20:35:58,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:35:58,591 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:35:58,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:35:58,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:35:58,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:35:58,592 INFO L87 Difference]: Start difference. First operand 21512 states and 87958 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:35:58,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:35:58,778 INFO L93 Difference]: Finished difference Result 22258 states and 91301 transitions. [2022-04-18 20:35:58,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:35:58,779 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:35:58,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:35:58,838 INFO L225 Difference]: With dead ends: 22258 [2022-04-18 20:35:58,838 INFO L226 Difference]: Without dead ends: 22258 [2022-04-18 20:35:58,839 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:35:58,839 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 34 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:35:58,839 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 235 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 130 Unchecked, 0.1s Time] [2022-04-18 20:35:58,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22258 states. [2022-04-18 20:35:59,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22258 to 21576. [2022-04-18 20:35:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21576 states, 21571 states have (on average 4.090213712855222) internal successors, (88230), 21575 states have internal predecessors, (88230), 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 20:35:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21576 states to 21576 states and 88230 transitions. [2022-04-18 20:35:59,272 INFO L78 Accepts]: Start accepts. Automaton has 21576 states and 88230 transitions. Word has length 22 [2022-04-18 20:35:59,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:35:59,272 INFO L478 AbstractCegarLoop]: Abstraction has 21576 states and 88230 transitions. [2022-04-18 20:35:59,354 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:35:59,354 INFO L276 IsEmpty]: Start isEmpty. Operand 21576 states and 88230 transitions. [2022-04-18 20:35:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:35:59,365 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:35:59,366 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:35:59,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (88)] Ended with exit code 0 [2022-04-18 20:35:59,566 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 88 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:35:59,566 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:35:59,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:35:59,566 INFO L85 PathProgramCache]: Analyzing trace with hash 90259761, now seen corresponding path program 10 times [2022-04-18 20:35:59,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:35:59,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836322238] [2022-04-18 20:35:59,567 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:35:59,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:35:59,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:35:59,568 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:35:59,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (89)] Waiting until timeout for monitored process [2022-04-18 20:35:59,929 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:35:59,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:35:59,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:35:59,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:36:00,162 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 11 treesize of output 7 [2022-04-18 20:36:00,217 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:36:00,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:36:00,386 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:36:00,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:36:00,523 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:36:00,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:36:00,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:00,748 INFO L356 Elim1Store]: treesize reduction 347, result has 9.9 percent of original size [2022-04-18 20:36:00,748 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 5 new quantified variables, introduced 9 case distinctions, treesize of input 77 treesize of output 102 [2022-04-18 20:36:00,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:00,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:00,805 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:36:00,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 87 [2022-04-18 20:36:00,932 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 20:36:00,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:36:00,932 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:36:00,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836322238] [2022-04-18 20:36:00,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836322238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:36:00,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:36:00,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:36:00,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042407175] [2022-04-18 20:36:00,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:36:00,933 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:36:00,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:36:00,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:36:00,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:36:00,934 INFO L87 Difference]: Start difference. First operand 21576 states and 88230 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:36:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:36:01,140 INFO L93 Difference]: Finished difference Result 22152 states and 90812 transitions. [2022-04-18 20:36:01,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:36:01,165 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:36:01,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:36:01,224 INFO L225 Difference]: With dead ends: 22152 [2022-04-18 20:36:01,225 INFO L226 Difference]: Without dead ends: 22152 [2022-04-18 20:36:01,225 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:36:01,225 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:36:01,225 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 178 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 74 Unchecked, 0.1s Time] [2022-04-18 20:36:01,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22152 states. [2022-04-18 20:36:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22152 to 21696. [2022-04-18 20:36:01,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21696 states, 21691 states have (on average 4.093771610345304) internal successors, (88798), 21695 states have internal predecessors, (88798), 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 20:36:01,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21696 states to 21696 states and 88798 transitions. [2022-04-18 20:36:01,755 INFO L78 Accepts]: Start accepts. Automaton has 21696 states and 88798 transitions. Word has length 22 [2022-04-18 20:36:01,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:36:01,755 INFO L478 AbstractCegarLoop]: Abstraction has 21696 states and 88798 transitions. [2022-04-18 20:36:01,756 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:36:01,756 INFO L276 IsEmpty]: Start isEmpty. Operand 21696 states and 88798 transitions. [2022-04-18 20:36:01,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:36:01,767 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:36:01,767 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:36:01,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (89)] Ended with exit code 0 [2022-04-18 20:36:01,974 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:36:01,975 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:36:01,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:36:01,975 INFO L85 PathProgramCache]: Analyzing trace with hash 90597351, now seen corresponding path program 11 times [2022-04-18 20:36:01,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:36:01,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227949681] [2022-04-18 20:36:01,976 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-18 20:36:01,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:36:01,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:36:01,977 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:36:01,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (90)] Waiting until timeout for monitored process [2022-04-18 20:36:02,424 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 20:36:02,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:36:02,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:36:02,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:36:02,651 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 11 treesize of output 7 [2022-04-18 20:36:02,728 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:36:02,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:36:02,909 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:36:02,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:36:03,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:03,113 INFO L356 Elim1Store]: treesize reduction 314, result has 10.5 percent of original size [2022-04-18 20:36:03,114 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 89 [2022-04-18 20:36:03,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:03,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:03,168 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:36:03,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 79 [2022-04-18 20:36:03,352 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:36:03,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:36:03,431 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 20:36:03,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:36:03,431 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:36:03,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227949681] [2022-04-18 20:36:03,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227949681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:36:03,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:36:03,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:36:03,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40031408] [2022-04-18 20:36:03,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:36:03,432 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:36:03,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:36:03,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:36:03,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:36:03,432 INFO L87 Difference]: Start difference. First operand 21696 states and 88798 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:36:03,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:36:03,610 INFO L93 Difference]: Finished difference Result 22094 states and 90541 transitions. [2022-04-18 20:36:03,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:36:03,611 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:36:03,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:36:03,670 INFO L225 Difference]: With dead ends: 22094 [2022-04-18 20:36:03,670 INFO L226 Difference]: Without dead ends: 22094 [2022-04-18 20:36:03,670 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:36:03,670 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 42 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:36:03,670 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 181 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 92 Unchecked, 0.1s Time] [2022-04-18 20:36:03,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22094 states. [2022-04-18 20:36:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22094 to 21696. [2022-04-18 20:36:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21696 states, 21691 states have (on average 4.093771610345304) internal successors, (88798), 21695 states have internal predecessors, (88798), 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 20:36:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21696 states to 21696 states and 88798 transitions. [2022-04-18 20:36:04,122 INFO L78 Accepts]: Start accepts. Automaton has 21696 states and 88798 transitions. Word has length 22 [2022-04-18 20:36:04,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:36:04,122 INFO L478 AbstractCegarLoop]: Abstraction has 21696 states and 88798 transitions. [2022-04-18 20:36:04,122 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:36:04,122 INFO L276 IsEmpty]: Start isEmpty. Operand 21696 states and 88798 transitions. [2022-04-18 20:36:04,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:36:04,133 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:36:04,133 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:36:04,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (90)] Ended with exit code 0 [2022-04-18 20:36:04,340 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:36:04,340 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:36:04,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:36:04,340 INFO L85 PathProgramCache]: Analyzing trace with hash 104233941, now seen corresponding path program 12 times [2022-04-18 20:36:04,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:36:04,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081331051] [2022-04-18 20:36:04,341 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-18 20:36:04,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:36:04,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:36:04,342 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:36:04,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (91)] Waiting until timeout for monitored process [2022-04-18 20:36:04,645 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-04-18 20:36:04,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:36:04,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-18 20:36:04,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:36:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-18 20:36:04,960 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:36:04,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:36:05,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:05,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:05,199 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:36:05,200 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 1 case distinctions, treesize of input 26 treesize of output 32 [2022-04-18 20:36:05,311 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:36:05,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:36:05,429 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:36:05,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:36:05,498 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 20:36:05,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:36:05,498 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:36:05,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081331051] [2022-04-18 20:36:05,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081331051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:36:05,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:36:05,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:36:05,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770616081] [2022-04-18 20:36:05,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:36:05,499 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:36:05,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:36:05,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:36:05,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:36:05,500 INFO L87 Difference]: Start difference. First operand 21696 states and 88798 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:36:05,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:36:05,675 INFO L93 Difference]: Finished difference Result 22156 states and 90888 transitions. [2022-04-18 20:36:05,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:36:05,676 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2022-04-18 20:36:05,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:36:05,896 INFO L225 Difference]: With dead ends: 22156 [2022-04-18 20:36:05,902 INFO L226 Difference]: Without dead ends: 22156 [2022-04-18 20:36:05,902 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:36:05,903 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 44 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:36:05,903 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 187 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 106 Unchecked, 0.1s Time] [2022-04-18 20:36:05,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22156 states. [2022-04-18 20:36:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22156 to 21776. [2022-04-18 20:36:06,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21776 states, 21771 states have (on average 4.094391621882321) internal successors, (89139), 21775 states have internal predecessors, (89139), 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 20:36:06,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21776 states to 21776 states and 89139 transitions. [2022-04-18 20:36:06,393 INFO L78 Accepts]: Start accepts. Automaton has 21776 states and 89139 transitions. Word has length 22 [2022-04-18 20:36:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:36:06,394 INFO L478 AbstractCegarLoop]: Abstraction has 21776 states and 89139 transitions. [2022-04-18 20:36:06,394 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:36:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 21776 states and 89139 transitions. [2022-04-18 20:36:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:36:06,405 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:36:06,405 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, 1] [2022-04-18 20:36:06,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (91)] Ended with exit code 0 [2022-04-18 20:36:06,612 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 91 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 [2022-04-18 20:36:06,612 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:36:06,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:36:06,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1860806821, now seen corresponding path program 5 times [2022-04-18 20:36:06,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:36:06,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646649717] [2022-04-18 20:36:06,613 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-18 20:36:06,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:36:06,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:36:06,614 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:36:06,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (92)] Waiting until timeout for monitored process [2022-04-18 20:36:07,065 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 20:36:07,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:36:07,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:36:07,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:36:07,321 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 11 treesize of output 7 [2022-04-18 20:36:07,394 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:36:07,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:36:07,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:07,572 INFO L356 Elim1Store]: treesize reduction 291, result has 11.6 percent of original size [2022-04-18 20:36:07,573 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 78 [2022-04-18 20:36:07,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:07,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:07,628 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:36:07,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 73 [2022-04-18 20:36:07,798 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:36:07,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:36:07,952 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:36:07,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:36:08,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:36:08,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:36:08,336 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (v_ArrVal_6478 (Array (_ BitVec 32) (_ BitVec 1))) (~A~0.offset (_ BitVec 32))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse0 ~A~0.offset) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_6478) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)) (_ bv0 1))) (forall ((thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (v_ArrVal_6478 (Array (_ BitVec 32) (_ BitVec 1))) (~A~0.offset (_ BitVec 32))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse1 ~A~0.offset) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_6478) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) is different from false [2022-04-18 20:36:13,110 INFO L356 Elim1Store]: treesize reduction 840, result has 7.9 percent of original size [2022-04-18 20:36:13,111 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 72 treesize of output 82 [2022-04-18 20:36:13,123 INFO L356 Elim1Store]: treesize reduction 249, result has 0.4 percent of original size [2022-04-18 20:36:13,123 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 93 treesize of output 44 [2022-04-18 20:36:13,129 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 9 treesize of output 7 [2022-04-18 20:36:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-04-18 20:36:13,328 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:36:13,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646649717] [2022-04-18 20:36:13,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646649717] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:36:13,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [436726395] [2022-04-18 20:36:13,328 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-18 20:36:13,328 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-04-18 20:36:13,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 [2022-04-18 20:36:13,329 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-04-18 20:36:13,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (93)] Waiting until timeout for monitored process [2022-04-18 20:36:14,719 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 20:36:14,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:36:14,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-18 20:36:14,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:36:15,183 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 11 treesize of output 7 [2022-04-18 20:36:15,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:15,270 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 21 treesize of output 20 [2022-04-18 20:36:15,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:15,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:15,424 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:36:15,424 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 1 case distinctions, treesize of input 26 treesize of output 32 [2022-04-18 20:36:15,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:15,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:15,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:15,582 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:36:15,582 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 1 case distinctions, treesize of input 30 treesize of output 32 [2022-04-18 20:36:15,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:15,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:15,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:15,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:15,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:15,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:15,713 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:36:15,713 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 3 case distinctions, treesize of input 39 treesize of output 44 [2022-04-18 20:36:15,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:36:15,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:36:16,085 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6557 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_6558 (Array (_ BitVec 32) (_ BitVec 1)))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_6558) c_~C~0.base v_ArrVal_6557) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) (forall ((v_ArrVal_6557 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_6558 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_6558) c_~C~0.base v_ArrVal_6557) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))))) is different from false [2022-04-18 20:36:16,103 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6557 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_6558 (Array (_ BitVec 32) (_ BitVec 1)))) (= (let ((.cse0 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 (_ bv0 1))) c_~A~0.base v_ArrVal_6558) c_~C~0.base v_ArrVal_6557) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) (_ bv0 1))) (forall ((v_ArrVal_6557 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_6558 (Array (_ BitVec 32) (_ BitVec 1)))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_6558) c_~C~0.base v_ArrVal_6557) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1)))) is different from false [2022-04-18 20:36:16,140 INFO L356 Elim1Store]: treesize reduction 20, result has 50.0 percent of original size [2022-04-18 20:36:16,140 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 2 case distinctions, treesize of input 28 treesize of output 35 [2022-04-18 20:36:16,155 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-04-18 20:36:16,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 127 [2022-04-18 20:36:16,161 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 51 treesize of output 43 [2022-04-18 20:36:16,164 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 94 treesize of output 78 [2022-04-18 20:36:16,210 INFO L356 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-04-18 20:36:16,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 1 [2022-04-18 20:36:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-04-18 20:36:16,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [436726395] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:36:16,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826725757] [2022-04-18 20:36:16,537 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-18 20:36:16,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:36:16,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:36:16,538 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:36:16,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-04-18 20:36:16,907 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 20:36:16,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:36:16,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-18 20:36:16,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:36:16,929 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 19 treesize of output 17 [2022-04-18 20:36:17,480 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 11 treesize of output 7 [2022-04-18 20:36:17,652 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:36:17,653 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 21 treesize of output 23 [2022-04-18 20:36:17,945 INFO L356 Elim1Store]: treesize reduction 291, result has 11.6 percent of original size [2022-04-18 20:36:17,946 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 78 [2022-04-18 20:36:17,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:17,997 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:36:17,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 73 [2022-04-18 20:36:18,869 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:36:18,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:36:18,943 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:36:18,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:36:19,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:36:19,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:36:19,152 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (v_ArrVal_6642 (Array (_ BitVec 32) (_ BitVec 1))) (~A~0.offset (_ BitVec 32))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse0 ~A~0.offset) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_6642) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) (forall ((thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (v_ArrVal_6642 (Array (_ BitVec 32) (_ BitVec 1))) (~A~0.offset (_ BitVec 32))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse1 ~A~0.offset) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_6642) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1)))) is different from false [2022-04-18 20:36:24,430 INFO L356 Elim1Store]: treesize reduction 841, result has 7.8 percent of original size [2022-04-18 20:36:24,430 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 74 treesize of output 83 [2022-04-18 20:36:24,442 INFO L356 Elim1Store]: treesize reduction 249, result has 0.4 percent of original size [2022-04-18 20:36:24,443 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 96 treesize of output 45 [2022-04-18 20:36:24,447 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 20:36:24,647 INFO L356 Elim1Store]: treesize reduction 911, result has 0.1 percent of original size [2022-04-18 20:36:24,647 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 6 case distinctions, treesize of input 72 treesize of output 1 [2022-04-18 20:36:24,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-04-18 20:36:24,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826725757] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:36:24,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-04-18 20:36:24,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 36 [2022-04-18 20:36:24,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087347391] [2022-04-18 20:36:24,694 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-04-18 20:36:24,694 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-18 20:36:24,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:36:24,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-18 20:36:24,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=938, Unknown=10, NotChecked=268, Total=1406 [2022-04-18 20:36:24,694 INFO L87 Difference]: Start difference. First operand 21776 states and 89139 transitions. Second operand has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 37 states have internal predecessors, (101), 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 20:36:28,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:36:28,070 INFO L93 Difference]: Finished difference Result 22526 states and 92707 transitions. [2022-04-18 20:36:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-18 20:36:28,071 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 37 states have internal predecessors, (101), 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 22 [2022-04-18 20:36:28,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:36:28,230 INFO L225 Difference]: With dead ends: 22526 [2022-04-18 20:36:28,230 INFO L226 Difference]: Without dead ends: 22526 [2022-04-18 20:36:28,230 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=236, Invalid=1102, Unknown=10, NotChecked=292, Total=1640 [2022-04-18 20:36:28,231 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 75 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 331 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:36:28,231 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 393 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 331 Unchecked, 0.2s Time] [2022-04-18 20:36:28,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22526 states. [2022-04-18 20:36:28,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22526 to 22016. [2022-04-18 20:36:28,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22016 states, 22011 states have (on average 4.10331198037345) internal successors, (90318), 22015 states have internal predecessors, (90318), 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 20:36:28,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22016 states to 22016 states and 90318 transitions. [2022-04-18 20:36:28,583 INFO L78 Accepts]: Start accepts. Automaton has 22016 states and 90318 transitions. Word has length 22 [2022-04-18 20:36:28,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:36:28,583 INFO L478 AbstractCegarLoop]: Abstraction has 22016 states and 90318 transitions. [2022-04-18 20:36:28,584 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 37 states have internal predecessors, (101), 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 20:36:28,584 INFO L276 IsEmpty]: Start isEmpty. Operand 22016 states and 90318 transitions. [2022-04-18 20:36:28,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:36:28,595 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:36:28,595 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, 1] [2022-04-18 20:36:28,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (92)] Forceful destruction successful, exit code 0 [2022-04-18 20:36:28,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (93)] Forceful destruction successful, exit code 0 [2022-04-18 20:36:29,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Forceful destruction successful, exit code 0 [2022-04-18 20:36:29,207 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 92 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3,93 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt,94 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:36:29,208 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:36:29,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:36:29,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1864032061, now seen corresponding path program 6 times [2022-04-18 20:36:29,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:36:29,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774977663] [2022-04-18 20:36:29,209 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-18 20:36:29,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:36:29,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:36:29,210 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:36:29,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (95)] Waiting until timeout for monitored process [2022-04-18 20:36:29,691 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-18 20:36:29,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:36:29,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:36:29,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:36:30,022 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 11 treesize of output 7 [2022-04-18 20:36:30,099 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:36:30,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:36:30,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:30,331 INFO L356 Elim1Store]: treesize reduction 293, result has 10.9 percent of original size [2022-04-18 20:36:30,331 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 76 [2022-04-18 20:36:30,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:30,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:30,390 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:36:30,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 71 [2022-04-18 20:36:30,587 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:36:30,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:36:30,785 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:36:30,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:36:30,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:36:30,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:36:31,128 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (~A~0.offset (_ BitVec 32)) (v_ArrVal_6716 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse0 ~A~0.offset) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_6716) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (forall ((thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (~A~0.offset (_ BitVec 32)) (v_ArrVal_6716 (Array (_ BitVec 32) (_ BitVec 1)))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse1 ~A~0.offset) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_6716) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)) (_ bv0 1)))) is different from false [2022-04-18 20:36:36,031 INFO L356 Elim1Store]: treesize reduction 840, result has 7.9 percent of original size [2022-04-18 20:36:36,031 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 72 treesize of output 82 [2022-04-18 20:36:36,043 INFO L356 Elim1Store]: treesize reduction 249, result has 0.4 percent of original size [2022-04-18 20:36:36,043 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 93 treesize of output 44 [2022-04-18 20:36:36,049 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 9 treesize of output 7 [2022-04-18 20:36:36,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-04-18 20:36:36,259 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-04-18 20:36:36,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774977663] [2022-04-18 20:36:36,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774977663] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:36:36,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1562890291] [2022-04-18 20:36:36,260 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-18 20:36:36,260 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-04-18 20:36:36,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 [2022-04-18 20:36:36,261 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-04-18 20:36:36,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (96)] Waiting until timeout for monitored process [2022-04-18 20:36:36,814 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-18 20:36:36,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:36:36,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-18 20:36:36,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:36:36,827 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 20 treesize of output 18 [2022-04-18 20:36:37,289 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 11 treesize of output 7 [2022-04-18 20:36:37,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:37,402 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 21 treesize of output 20 [2022-04-18 20:36:37,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:37,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:37,561 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:36:37,561 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 1 case distinctions, treesize of input 26 treesize of output 32 [2022-04-18 20:36:37,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:37,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:37,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:37,728 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:36:37,728 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 1 case distinctions, treesize of input 30 treesize of output 32 [2022-04-18 20:36:37,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:37,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:37,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:37,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:37,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:37,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:37,937 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:36:37,938 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 3 case distinctions, treesize of input 39 treesize of output 44 [2022-04-18 20:36:38,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:36:38,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:36:38,162 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6794 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_6795) c_~C~0.base v_ArrVal_6794) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (forall ((v_ArrVal_6794 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_6795) c_~C~0.base v_ArrVal_6794) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))))) is different from false [2022-04-18 20:36:38,182 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6794 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_6795) c_~C~0.base v_ArrVal_6794) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (forall ((v_ArrVal_6794 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (let ((.cse0 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 (_ bv0 1))) c_~A~0.base v_ArrVal_6795) c_~C~0.base v_ArrVal_6794) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0))))) is different from false [2022-04-18 20:36:38,226 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-04-18 20:36:38,226 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 2 case distinctions, treesize of input 26 treesize of output 32 [2022-04-18 20:36:38,235 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-04-18 20:36:38,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 56 [2022-04-18 20:36:38,240 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 24 treesize of output 22 [2022-04-18 20:36:38,244 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 38 treesize of output 34 [2022-04-18 20:36:38,310 INFO L356 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-04-18 20:36:38,310 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 2 case distinctions, treesize of input 28 treesize of output 1 [2022-04-18 20:36:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-04-18 20:36:38,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1562890291] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:36:38,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432072181] [2022-04-18 20:36:38,790 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-18 20:36:38,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:36:38,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:36:38,791 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:36:38,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-04-18 20:36:39,231 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-18 20:36:39,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:36:39,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-18 20:36:39,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:36:39,308 INFO L356 Elim1Store]: treesize reduction 84, result has 22.9 percent of original size [2022-04-18 20:36:39,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 46 [2022-04-18 20:36:39,479 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:36:39,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-04-18 20:36:39,786 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-18 20:36:39,918 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:36:39,918 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 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:36:40,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-04-18 20:36:40,103 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:36:40,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:36:40,203 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:36:40,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:36:40,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:36:40,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:36:40,316 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6872 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_6873 (Array (_ BitVec 32) (_ BitVec 1)))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_6873) c_~C~0.base v_ArrVal_6872) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)) (_ bv0 1))) (forall ((v_ArrVal_6872 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_6873 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_6873) c_~C~0.base v_ArrVal_6872) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) is different from false [2022-04-18 20:36:40,335 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6872 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_6873 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (let ((.cse0 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 (_ bv0 1))) c_~A~0.base v_ArrVal_6873) c_~C~0.base v_ArrVal_6872) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)))) (forall ((v_ArrVal_6872 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_6873 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|) (_ bv0 1))) c_~A~0.base v_ArrVal_6873) c_~C~0.base v_ArrVal_6872) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) is different from false [2022-04-18 20:36:40,373 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-04-18 20:36:40,373 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 2 case distinctions, treesize of input 28 treesize of output 34 [2022-04-18 20:36:40,382 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-04-18 20:36:40,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 62 [2022-04-18 20:36:40,388 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 30 treesize of output 26 [2022-04-18 20:36:40,391 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 46 treesize of output 38 [2022-04-18 20:36:40,444 INFO L356 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-04-18 20:36:40,444 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 2 case distinctions, treesize of input 26 treesize of output 1 [2022-04-18 20:36:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-04-18 20:36:40,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432072181] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:36:40,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-04-18 20:36:40,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 37 [2022-04-18 20:36:40,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026944297] [2022-04-18 20:36:40,672 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-04-18 20:36:40,672 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-18 20:36:40,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-04-18 20:36:40,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-18 20:36:40,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=969, Unknown=6, NotChecked=340, Total=1482 [2022-04-18 20:36:40,672 INFO L87 Difference]: Start difference. First operand 22016 states and 90318 transitions. Second operand has 39 states, 38 states have (on average 2.736842105263158) internal successors, (104), 38 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:36:42,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:36:42,386 INFO L93 Difference]: Finished difference Result 22544 states and 92640 transitions. [2022-04-18 20:36:42,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:36:42,387 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.736842105263158) internal successors, (104), 38 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-04-18 20:36:42,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:36:42,453 INFO L225 Difference]: With dead ends: 22544 [2022-04-18 20:36:42,453 INFO L226 Difference]: Without dead ends: 22544 [2022-04-18 20:36:42,453 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=242, Invalid=1332, Unknown=6, NotChecked=400, Total=1980 [2022-04-18 20:36:42,462 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 117 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 493 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-18 20:36:42,462 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 512 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 124 Invalid, 0 Unknown, 493 Unchecked, 0.4s Time] [2022-04-18 20:36:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22544 states. [2022-04-18 20:36:42,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22544 to 21952. [2022-04-18 20:36:42,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21952 states, 21947 states have (on average 4.10051487674853) internal successors, (89994), 21951 states have internal predecessors, (89994), 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 20:36:42,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21952 states to 21952 states and 89994 transitions. [2022-04-18 20:36:42,856 INFO L78 Accepts]: Start accepts. Automaton has 21952 states and 89994 transitions. Word has length 22 [2022-04-18 20:36:42,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:36:42,856 INFO L478 AbstractCegarLoop]: Abstraction has 21952 states and 89994 transitions. [2022-04-18 20:36:42,879 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.736842105263158) internal successors, (104), 38 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:36:42,879 INFO L276 IsEmpty]: Start isEmpty. Operand 21952 states and 89994 transitions. [2022-04-18 20:36:42,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:36:42,903 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:36:42,903 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, 1] [2022-04-18 20:36:42,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (95)] Forceful destruction successful, exit code 0 [2022-04-18 20:36:43,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt (96)] Forceful destruction successful, exit code 0 [2022-04-18 20:36:43,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Forceful destruction successful, exit code 0 [2022-04-18 20:36:43,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3,96 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4 --incremental --print-success --lang smt,97 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:36:43,511 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 20:36:43,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:36:43,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2065496101, now seen corresponding path program 7 times [2022-04-18 20:36:43,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-04-18 20:36:43,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696564705] [2022-04-18 20:36:43,512 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-18 20:36:43,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-04-18 20:36:43,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat [2022-04-18 20:36:43,513 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-04-18 20:36:43,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/mathsat -unsat_core_generation=3 (98)] Waiting until timeout for monitored process [2022-04-18 20:36:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:36:43,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 20:36:43,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:36:44,240 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 11 treesize of output 7 [2022-04-18 20:36:44,311 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:36:44,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2022-04-18 20:36:44,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:44,485 INFO L356 Elim1Store]: treesize reduction 292, result has 11.2 percent of original size [2022-04-18 20:36:44,485 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 77 [2022-04-18 20:36:44,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:44,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:36:44,542 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:36:44,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 72 [2022-04-18 20:36:44,749 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-04-18 20:36:44,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-04-18 20:36:44,887 INFO L356 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2022-04-18 20:36:44,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 53 [2022-04-18 20:36:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:36:44,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:36:45,188 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (~A~0.offset (_ BitVec 32)) (v_ArrVal_6948 (Array (_ BitVec 32) (_ BitVec 1)))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse0 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse0 ~A~0.offset) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse0 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_6948) |c_ULTIMATE.start_main_~#t1~0#1.base|) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~#t1~0#1.offset|)) (_ bv0 1))) (forall ((thread2Thread1of1ForFork0_~i~1 (_ BitVec 32)) (~A~0.offset (_ BitVec 32)) (v_ArrVal_6948 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (store (store (store (store (select |c_#race| c_~A~0.base) (bvadd .cse1 ~A~0.offset) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv1 32)) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv2 32)) (_ bv0 1)) (bvadd .cse1 ~A~0.offset (_ bv3 32)) (_ bv0 1)))) c_~C~0.base v_ArrVal_6948) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) is different from false Killed by 15