./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-max.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-three-array-max.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 306d85d0b5300749928a8392783cd7ec5acf0c4622b6bdba80c3589786dd98ad --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 20:22:36,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 20:22:36,167 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 20:22:36,213 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 20:22:36,214 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 20:22:36,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 20:22:36,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 20:22:36,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 20:22:36,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 20:22:36,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 20:22:36,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 20:22:36,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 20:22:36,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 20:22:36,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 20:22:36,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 20:22:36,234 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 20:22:36,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 20:22:36,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 20:22:36,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 20:22:36,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 20:22:36,244 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 20:22:36,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 20:22:36,246 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 20:22:36,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 20:22:36,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 20:22:36,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 20:22:36,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 20:22:36,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 20:22:36,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 20:22:36,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 20:22:36,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 20:22:36,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 20:22:36,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 20:22:36,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 20:22:36,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 20:22:36,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 20:22:36,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 20:22:36,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 20:22:36,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 20:22:36,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 20:22:36,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 20:22:36,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 20:22:36,266 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:36,293 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 20:22:36,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 20:22:36,294 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 20:22:36,294 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 20:22:36,295 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 20:22:36,295 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 20:22:36,295 INFO L138 SettingsManager]: * User list type=DISABLED [2022-04-18 20:22:36,296 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-04-18 20:22:36,296 INFO L138 SettingsManager]: * Explicit value domain=true [2022-04-18 20:22:36,297 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-04-18 20:22:36,297 INFO L138 SettingsManager]: * Octagon Domain=false [2022-04-18 20:22:36,297 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-04-18 20:22:36,297 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-04-18 20:22:36,297 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-04-18 20:22:36,297 INFO L138 SettingsManager]: * Interval Domain=false [2022-04-18 20:22:36,298 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-04-18 20:22:36,298 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-04-18 20:22:36,298 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-04-18 20:22:36,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 20:22:36,299 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 20:22:36,300 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 20:22:36,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 20:22:36,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 20:22:36,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 20:22:36,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 20:22:36,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 20:22:36,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 20:22:36,301 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 20:22:36,301 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 20:22:36,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 20:22:36,301 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 20:22:36,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 20:22:36,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 20:22:36,302 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 20:22:36,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 20:22:36,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 20:22:36,303 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 20:22:36,303 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 20:22:36,303 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-04-18 20:22:36,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 20:22:36,303 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 20:22:36,303 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-18 20:22:36,304 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-18 20:22:36,304 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 -> 306d85d0b5300749928a8392783cd7ec5acf0c4622b6bdba80c3589786dd98ad [2022-04-18 20:22:36,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 20:22:36,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 20:22:36,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 20:22:36,576 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 20:22:36,576 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 20:22:36,578 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c [2022-04-18 20:22:36,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f39c90009/bfe175e4388c4be1b69e90b8e0943de0/FLAGdd2b62fa8 [2022-04-18 20:22:37,036 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 20:22:37,036 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c [2022-04-18 20:22:37,051 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f39c90009/bfe175e4388c4be1b69e90b8e0943de0/FLAGdd2b62fa8 [2022-04-18 20:22:37,458 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f39c90009/bfe175e4388c4be1b69e90b8e0943de0 [2022-04-18 20:22:37,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 20:22:37,469 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 20:22:37,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 20:22:37,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 20:22:37,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 20:22:37,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 08:22:37" (1/1) ... [2022-04-18 20:22:37,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f90f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:22:37, skipping insertion in model container [2022-04-18 20:22:37,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 08:22:37" (1/1) ... [2022-04-18 20:22:37,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 20:22:37,514 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 20:22:37,671 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-three-array-max.wvr.c[2823,2836] [2022-04-18 20:22:37,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 20:22:37,686 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 20:22:37,720 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-three-array-max.wvr.c[2823,2836] [2022-04-18 20:22:37,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 20:22:37,738 INFO L208 MainTranslator]: Completed translation [2022-04-18 20:22:37,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:22:37 WrapperNode [2022-04-18 20:22:37,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 20:22:37,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 20:22:37,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 20:22:37,741 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 20:22:37,747 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:37" (1/1) ... [2022-04-18 20:22:37,761 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:37" (1/1) ... [2022-04-18 20:22:37,803 INFO L137 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 371 [2022-04-18 20:22:37,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 20:22:37,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 20:22:37,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 20:22:37,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 20:22:37,813 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:37" (1/1) ... [2022-04-18 20:22:37,813 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:37" (1/1) ... [2022-04-18 20:22:37,820 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:37" (1/1) ... [2022-04-18 20:22:37,821 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:37" (1/1) ... [2022-04-18 20:22:37,849 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:37" (1/1) ... [2022-04-18 20:22:37,855 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:37" (1/1) ... [2022-04-18 20:22:37,858 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:37" (1/1) ... [2022-04-18 20:22:37,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 20:22:37,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 20:22:37,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 20:22:37,871 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 20:22:37,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:22:37" (1/1) ... [2022-04-18 20:22:37,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 20:22:37,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:22:37,921 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:37,941 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:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 20:22:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 20:22:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 20:22:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-18 20:22:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-04-18 20:22:37,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-04-18 20:22:37,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-04-18 20:22:37,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-04-18 20:22:37,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-04-18 20:22:37,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-04-18 20:22:37,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 20:22:37,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-04-18 20:22:37,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-04-18 20:22:37,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-18 20:22:37,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 20:22:37,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 20:22:37,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 20:22:37,976 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:38,090 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 20:22:38,092 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 20:22:38,720 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 20:22:38,920 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 20:22:38,921 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-18 20:22:38,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 08:22:38 BoogieIcfgContainer [2022-04-18 20:22:38,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 20:22:38,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 20:22:38,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 20:22:38,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 20:22:38,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 08:22:37" (1/3) ... [2022-04-18 20:22:38,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3522aeb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 08:22:38, skipping insertion in model container [2022-04-18 20:22:38,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:22:37" (2/3) ... [2022-04-18 20:22:38,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3522aeb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 08:22:38, skipping insertion in model container [2022-04-18 20:22:38,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 08:22:38" (3/3) ... [2022-04-18 20:22:38,935 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2022-04-18 20:22:38,943 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 20:22:38,944 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 20:22:38,944 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2022-04-18 20:22:38,944 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 20:22:39,057 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-04-18 20:22:39,115 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 20:22:39,124 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:39,125 INFO L341 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2022-04-18 20:22:39,175 INFO L116 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-04-18 20:22:39,204 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 511 places, 528 transitions, 1080 flow [2022-04-18 20:22:39,207 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 511 places, 528 transitions, 1080 flow [2022-04-18 20:22:39,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 511 places, 528 transitions, 1080 flow [2022-04-18 20:22:39,412 INFO L129 PetriNetUnfolder]: 27/525 cut-off events. [2022-04-18 20:22:39,413 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-04-18 20:22:39,421 INFO L84 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 525 events. 27/525 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 622 event pairs, 0 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 421. Up to 3 conditions per place. [2022-04-18 20:22:39,431 INFO L116 LiptonReduction]: Number of co-enabled transitions 13362 [2022-04-18 20:26:47,281 INFO L131 LiptonReduction]: Checked pairs total: 93489 [2022-04-18 20:26:47,282 INFO L133 LiptonReduction]: Total number of compositions: 654 [2022-04-18 20:26:47,288 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 130 places, 132 transitions, 288 flow [2022-04-18 20:26:49,253 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 52279 states, 49896 states have (on average 4.336640211640212) internal successors, (216381), 52278 states have internal predecessors, (216381), 0 states have call successors, (0), 0 states have call 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:49,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 52279 states, 49896 states have (on average 4.336640211640212) internal successors, (216381), 52278 states have internal predecessors, (216381), 0 states have call successors, (0), 0 states have call 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:49,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-04-18 20:26:49,381 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:49,382 INFO L499 BasicCegarLoop]: trace histogram [1] [2022-04-18 20:26:49,382 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:26:49,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:49,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2152, now seen corresponding path program 1 times [2022-04-18 20:26:49,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:49,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131855991] [2022-04-18 20:26:49,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:49,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:49,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:26:49,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:49,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131855991] [2022-04-18 20:26:49,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131855991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:26:49,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:26:49,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-04-18 20:26:49,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38602573] [2022-04-18 20:26:49,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:26:49,480 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-18 20:26:49,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:49,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-18 20:26:49,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 20:26:49,612 INFO L87 Difference]: Start difference. First operand has 52279 states, 49896 states have (on average 4.336640211640212) internal successors, (216381), 52278 states have internal predecessors, (216381), 0 states have call successors, (0), 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:26:50,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:50,041 INFO L93 Difference]: Finished difference Result 5616 states and 22643 transitions. [2022-04-18 20:26:50,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 20:26:50,044 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:26:50,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:50,099 INFO L225 Difference]: With dead ends: 5616 [2022-04-18 20:26:50,099 INFO L226 Difference]: Without dead ends: 5585 [2022-04-18 20:26:50,100 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:26:50,103 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-18 20:26:50,103 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-18 20:26:50,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5585 states. [2022-04-18 20:26:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5585 to 5585. [2022-04-18 20:26:50,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5585 states, 5573 states have (on average 4.047371254261619) internal successors, (22556), 5584 states have internal predecessors, (22556), 0 states have call successors, (0), 0 states have call 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:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5585 states to 5585 states and 22556 transitions. [2022-04-18 20:26:50,354 INFO L78 Accepts]: Start accepts. Automaton has 5585 states and 22556 transitions. Word has length 1 [2022-04-18 20:26:50,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:50,354 INFO L478 AbstractCegarLoop]: Abstraction has 5585 states and 22556 transitions. [2022-04-18 20:26:50,354 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:26:50,355 INFO L276 IsEmpty]: Start isEmpty. Operand 5585 states and 22556 transitions. [2022-04-18 20:26:50,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-18 20:26:50,356 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:50,357 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:26:50,357 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 20:26:50,357 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:26:50,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:50,358 INFO L85 PathProgramCache]: Analyzing trace with hash 308507361, now seen corresponding path program 1 times [2022-04-18 20:26:50,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:50,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879993965] [2022-04-18 20:26:50,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:50,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:50,566 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:26:50,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:50,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879993965] [2022-04-18 20:26:50,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879993965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:26:50,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:26:50,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 20:26:50,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637382917] [2022-04-18 20:26:50,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:26:50,569 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 20:26:50,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:50,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 20:26:50,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 20:26:50,570 INFO L87 Difference]: Start difference. First operand 5585 states and 22556 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call 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:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:50,856 INFO L93 Difference]: Finished difference Result 5586 states and 22557 transitions. [2022-04-18 20:26:50,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 20:26:50,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-04-18 20:26:50,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:50,899 INFO L225 Difference]: With dead ends: 5586 [2022-04-18 20:26:50,900 INFO L226 Difference]: Without dead ends: 5586 [2022-04-18 20:26:50,900 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 20:26:50,901 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:26:50,902 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-18 20:26:50,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5586 states. [2022-04-18 20:26:51,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5586 to 5586. [2022-04-18 20:26:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5586 states, 5574 states have (on average 4.046824542518838) internal successors, (22557), 5585 states have internal predecessors, (22557), 0 states have call successors, (0), 0 states have call 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:51,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5586 states to 5586 states and 22557 transitions. [2022-04-18 20:26:51,234 INFO L78 Accepts]: Start accepts. Automaton has 5586 states and 22557 transitions. Word has length 13 [2022-04-18 20:26:51,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:51,234 INFO L478 AbstractCegarLoop]: Abstraction has 5586 states and 22557 transitions. [2022-04-18 20:26:51,235 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call 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:51,235 INFO L276 IsEmpty]: Start isEmpty. Operand 5586 states and 22557 transitions. [2022-04-18 20:26:51,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-18 20:26:51,236 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:51,236 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:26:51,237 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-18 20:26:51,237 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:26:51,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:51,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1205302724, now seen corresponding path program 1 times [2022-04-18 20:26:51,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:51,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733862830] [2022-04-18 20:26:51,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:51,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:26:51,442 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:51,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733862830] [2022-04-18 20:26:51,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733862830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:26:51,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:26:51,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:26:51,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77099013] [2022-04-18 20:26:51,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:26:51,444 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:26:51,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:51,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:26:51,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:26:51,444 INFO L87 Difference]: Start difference. First operand 5586 states and 22557 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:26:52,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:52,957 INFO L93 Difference]: Finished difference Result 9026 states and 36659 transitions. [2022-04-18 20:26:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:26:52,957 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:26:52,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:53,005 INFO L225 Difference]: With dead ends: 9026 [2022-04-18 20:26:53,005 INFO L226 Difference]: Without dead ends: 9026 [2022-04-18 20:26:53,006 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:26:53,007 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 80 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-18 20:26:53,007 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 71 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-18 20:26:53,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9026 states. [2022-04-18 20:26:53,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9026 to 6506. [2022-04-18 20:26:53,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6506 states, 6494 states have (on average 4.064213119802895) internal successors, (26393), 6505 states have internal predecessors, (26393), 0 states have call successors, (0), 0 states have call 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:53,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 26393 transitions. [2022-04-18 20:26:53,220 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 26393 transitions. Word has length 14 [2022-04-18 20:26:53,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:53,220 INFO L478 AbstractCegarLoop]: Abstraction has 6506 states and 26393 transitions. [2022-04-18 20:26:53,220 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:26:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 26393 transitions. [2022-04-18 20:26:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-18 20:26:53,222 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:53,222 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:26:53,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-18 20:26:53,223 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:26:53,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:53,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1290340710, now seen corresponding path program 1 times [2022-04-18 20:26:53,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:53,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180828123] [2022-04-18 20:26:53,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:53,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:26:53,284 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:53,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180828123] [2022-04-18 20:26:53,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180828123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:26:53,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:26:53,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 20:26:53,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870101079] [2022-04-18 20:26:53,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:26:53,286 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 20:26:53,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:53,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 20:26:53,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 20:26:53,287 INFO L87 Difference]: Start difference. First operand 6506 states and 26393 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:26:53,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:53,674 INFO L93 Difference]: Finished difference Result 10116 states and 41047 transitions. [2022-04-18 20:26:53,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 20:26:53,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-04-18 20:26:53,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:53,718 INFO L225 Difference]: With dead ends: 10116 [2022-04-18 20:26:53,719 INFO L226 Difference]: Without dead ends: 10116 [2022-04-18 20:26:53,719 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 20:26:53,720 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 57 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:26:53,720 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 91 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-18 20:26:53,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10116 states. [2022-04-18 20:26:53,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10116 to 6336. [2022-04-18 20:26:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6336 states, 6326 states have (on average 4.064653809674359) internal successors, (25713), 6335 states have internal predecessors, (25713), 0 states have call successors, (0), 0 states have call 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:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6336 states to 6336 states and 25713 transitions. [2022-04-18 20:26:53,919 INFO L78 Accepts]: Start accepts. Automaton has 6336 states and 25713 transitions. Word has length 15 [2022-04-18 20:26:53,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:53,920 INFO L478 AbstractCegarLoop]: Abstraction has 6336 states and 25713 transitions. [2022-04-18 20:26:53,920 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:26:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 6336 states and 25713 transitions. [2022-04-18 20:26:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-18 20:26:53,922 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:53,922 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:26:53,923 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-18 20:26:53,923 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:26:53,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:53,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1239192769, now seen corresponding path program 1 times [2022-04-18 20:26:53,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:53,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602113353] [2022-04-18 20:26:53,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:53,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:26:53,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:53,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602113353] [2022-04-18 20:26:53,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602113353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:26:53,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:26:53,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 20:26:53,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442873797] [2022-04-18 20:26:53,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:26:53,995 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-18 20:26:53,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:53,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-18 20:26:53,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-18 20:26:53,996 INFO L87 Difference]: Start difference. First operand 6336 states and 25713 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call 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:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:54,224 INFO L93 Difference]: Finished difference Result 6338 states and 25715 transitions. [2022-04-18 20:26:54,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-18 20:26:54,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-04-18 20:26:54,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:54,252 INFO L225 Difference]: With dead ends: 6338 [2022-04-18 20:26:54,252 INFO L226 Difference]: Without dead ends: 6338 [2022-04-18 20:26:54,253 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-18 20:26:54,253 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 67 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:26:54,254 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 76 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-18 20:26:54,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2022-04-18 20:26:54,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 6338. [2022-04-18 20:26:54,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6338 states, 6328 states have (on average 4.063685208596713) internal successors, (25715), 6337 states have internal predecessors, (25715), 0 states have call successors, (0), 0 states have call 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:54,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6338 states to 6338 states and 25715 transitions. [2022-04-18 20:26:54,514 INFO L78 Accepts]: Start accepts. Automaton has 6338 states and 25715 transitions. Word has length 16 [2022-04-18 20:26:54,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:54,514 INFO L478 AbstractCegarLoop]: Abstraction has 6338 states and 25715 transitions. [2022-04-18 20:26:54,515 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call 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:54,515 INFO L276 IsEmpty]: Start isEmpty. Operand 6338 states and 25715 transitions. [2022-04-18 20:26:54,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-18 20:26:54,516 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:54,516 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:26:54,516 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-18 20:26:54,516 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:26:54,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:54,517 INFO L85 PathProgramCache]: Analyzing trace with hash -344031214, now seen corresponding path program 1 times [2022-04-18 20:26:54,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:54,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150784052] [2022-04-18 20:26:54,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:54,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:26:54,693 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:54,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150784052] [2022-04-18 20:26:54,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150784052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:26:54,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:26:54,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:26:54,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821061345] [2022-04-18 20:26:54,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:26:54,694 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:26:54,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:54,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:26:54,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:26:54,695 INFO L87 Difference]: Start difference. First operand 6338 states and 25715 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:26:55,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:55,845 INFO L93 Difference]: Finished difference Result 9223 states and 37357 transitions. [2022-04-18 20:26:55,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:26:55,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-04-18 20:26:55,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:55,885 INFO L225 Difference]: With dead ends: 9223 [2022-04-18 20:26:55,885 INFO L226 Difference]: Without dead ends: 9223 [2022-04-18 20:26:55,885 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:26:55,886 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 112 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:26:55,886 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 92 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-18 20:26:55,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9223 states. [2022-04-18 20:26:56,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9223 to 8533. [2022-04-18 20:26:56,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8533 states, 8523 states have (on average 4.118737533732254) internal successors, (35104), 8532 states have internal predecessors, (35104), 0 states have call successors, (0), 0 states have call 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:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8533 states to 8533 states and 35104 transitions. [2022-04-18 20:26:56,140 INFO L78 Accepts]: Start accepts. Automaton has 8533 states and 35104 transitions. Word has length 18 [2022-04-18 20:26:56,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:56,141 INFO L478 AbstractCegarLoop]: Abstraction has 8533 states and 35104 transitions. [2022-04-18 20:26:56,142 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:26:56,142 INFO L276 IsEmpty]: Start isEmpty. Operand 8533 states and 35104 transitions. [2022-04-18 20:26:56,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 20:26:56,145 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:56,145 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] [2022-04-18 20:26:56,145 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-18 20:26:56,145 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:26:56,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:56,146 INFO L85 PathProgramCache]: Analyzing trace with hash 484657626, now seen corresponding path program 1 times [2022-04-18 20:26:56,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:56,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167814509] [2022-04-18 20:26:56,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:56,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:26:56,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:56,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167814509] [2022-04-18 20:26:56,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167814509] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:26:56,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137295392] [2022-04-18 20:26:56,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:56,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:26:56,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:26:56,279 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:26:56,303 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:26:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:56,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-18 20:26:56,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:26:56,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:26:56,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:26:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:26:56,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137295392] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:26:56,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [875012770] [2022-04-18 20:26:56,844 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:56,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:26:56,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-18 20:26:56,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184268050] [2022-04-18 20:26:56,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:26:56,847 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-18 20:26:56,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:56,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-18 20:26:56,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-04-18 20:26:56,848 INFO L87 Difference]: Start difference. First operand 8533 states and 35104 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:26:58,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:58,193 INFO L93 Difference]: Finished difference Result 9581 states and 38984 transitions. [2022-04-18 20:26:58,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-18 20:26:58,194 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-04-18 20:26:58,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:58,224 INFO L225 Difference]: With dead ends: 9581 [2022-04-18 20:26:58,225 INFO L226 Difference]: Without dead ends: 9581 [2022-04-18 20:26:58,225 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-04-18 20:26:58,226 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 133 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:26:58,226 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 400 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-18 20:26:58,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9581 states. [2022-04-18 20:26:58,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9581 to 9216. [2022-04-18 20:26:58,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9216 states, 9206 states have (on average 4.111449054964154) internal successors, (37850), 9215 states have internal predecessors, (37850), 0 states have call successors, (0), 0 states have call 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:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 37850 transitions. [2022-04-18 20:26:58,448 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 37850 transitions. Word has length 21 [2022-04-18 20:26:58,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:58,449 INFO L478 AbstractCegarLoop]: Abstraction has 9216 states and 37850 transitions. [2022-04-18 20:26:58,449 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:26:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 37850 transitions. [2022-04-18 20:26:58,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 20:26:58,452 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:58,452 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] [2022-04-18 20:26:58,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-18 20:26:58,657 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-04-18 20:26:58,657 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:26:58,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:58,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1601753119, now seen corresponding path program 1 times [2022-04-18 20:26:58,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:58,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908638014] [2022-04-18 20:26:58,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:58,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:58,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:26:58,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:58,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908638014] [2022-04-18 20:26:58,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908638014] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:26:58,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179393109] [2022-04-18 20:26:58,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:58,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:26:58,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:26:58,791 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:26:58,799 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:26:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:58,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-18 20:26:58,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:26:59,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:26:59,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:26:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:26:59,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179393109] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:26:59,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [983013383] [2022-04-18 20:26:59,242 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:59,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:26:59,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-18 20:26:59,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860521806] [2022-04-18 20:26:59,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:26:59,245 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-18 20:26:59,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:59,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-18 20:26:59,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-04-18 20:26:59,246 INFO L87 Difference]: Start difference. First operand 9216 states and 37850 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call 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:59,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:59,922 INFO L93 Difference]: Finished difference Result 9281 states and 37616 transitions. [2022-04-18 20:26:59,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-18 20:26:59,922 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-04-18 20:26:59,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:59,954 INFO L225 Difference]: With dead ends: 9281 [2022-04-18 20:26:59,954 INFO L226 Difference]: Without dead ends: 9281 [2022-04-18 20:26:59,955 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-04-18 20:26:59,955 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 217 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-18 20:26:59,955 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 399 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-18 20:27:00,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9281 states. [2022-04-18 20:27:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9281 to 9209. [2022-04-18 20:27:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9209 states, 9199 states have (on average 4.072725296227851) internal successors, (37465), 9208 states have internal predecessors, (37465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:00,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9209 states to 9209 states and 37465 transitions. [2022-04-18 20:27:00,229 INFO L78 Accepts]: Start accepts. Automaton has 9209 states and 37465 transitions. Word has length 21 [2022-04-18 20:27:00,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:27:00,229 INFO L478 AbstractCegarLoop]: Abstraction has 9209 states and 37465 transitions. [2022-04-18 20:27:00,229 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:00,229 INFO L276 IsEmpty]: Start isEmpty. Operand 9209 states and 37465 transitions. [2022-04-18 20:27:00,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-18 20:27:00,234 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:27:00,234 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:27:00,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-18 20:27:00,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:27:00,447 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:27:00,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:27:00,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1394059000, now seen corresponding path program 2 times [2022-04-18 20:27:00,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:27:00,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511379968] [2022-04-18 20:27:00,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:27:00,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:27:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:27:00,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-18 20:27:00,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:27:00,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511379968] [2022-04-18 20:27:00,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511379968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:27:00,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:27:00,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-18 20:27:00,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671579280] [2022-04-18 20:27:00,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:27:00,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-18 20:27:00,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:27:00,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-18 20:27:00,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-18 20:27:00,767 INFO L87 Difference]: Start difference. First operand 9209 states and 37465 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:27:02,697 INFO L93 Difference]: Finished difference Result 22681 states and 92305 transitions. [2022-04-18 20:27:02,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-18 20:27:02,697 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-04-18 20:27:02,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:27:02,762 INFO L225 Difference]: With dead ends: 22681 [2022-04-18 20:27:02,762 INFO L226 Difference]: Without dead ends: 22681 [2022-04-18 20:27:02,763 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2022-04-18 20:27:02,763 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 515 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-18 20:27:02,764 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [515 Valid, 157 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-18 20:27:02,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22681 states. [2022-04-18 20:27:03,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22681 to 11328. [2022-04-18 20:27:03,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11328 states, 11318 states have (on average 4.166018731224598) internal successors, (47151), 11327 states have internal predecessors, (47151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:03,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11328 states to 11328 states and 47151 transitions. [2022-04-18 20:27:03,209 INFO L78 Accepts]: Start accepts. Automaton has 11328 states and 47151 transitions. Word has length 24 [2022-04-18 20:27:03,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:27:03,210 INFO L478 AbstractCegarLoop]: Abstraction has 11328 states and 47151 transitions. [2022-04-18 20:27:03,210 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:03,210 INFO L276 IsEmpty]: Start isEmpty. Operand 11328 states and 47151 transitions. [2022-04-18 20:27:03,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-18 20:27:03,215 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:27:03,215 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:27:03,215 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-18 20:27:03,216 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:27:03,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:27:03,216 INFO L85 PathProgramCache]: Analyzing trace with hash -276963507, now seen corresponding path program 2 times [2022-04-18 20:27:03,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:27:03,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644296419] [2022-04-18 20:27:03,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:27:03,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:27:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:27:03,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-18 20:27:03,513 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:27:03,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644296419] [2022-04-18 20:27:03,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644296419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:27:03,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:27:03,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-18 20:27:03,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234841273] [2022-04-18 20:27:03,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:27:03,514 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-18 20:27:03,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:27:03,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-18 20:27:03,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:27:03,515 INFO L87 Difference]: Start difference. First operand 11328 states and 47151 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:04,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:27:04,637 INFO L93 Difference]: Finished difference Result 10613 states and 44018 transitions. [2022-04-18 20:27:04,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-18 20:27:04,638 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-04-18 20:27:04,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:27:04,677 INFO L225 Difference]: With dead ends: 10613 [2022-04-18 20:27:04,677 INFO L226 Difference]: Without dead ends: 10613 [2022-04-18 20:27:04,677 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-04-18 20:27:04,678 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 274 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-18 20:27:04,678 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 66 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-18 20:27:04,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10613 states. [2022-04-18 20:27:04,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10613 to 7753. [2022-04-18 20:27:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7753 states, 7748 states have (on average 4.063758389261745) internal successors, (31486), 7752 states have internal predecessors, (31486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:04,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7753 states to 7753 states and 31486 transitions. [2022-04-18 20:27:04,917 INFO L78 Accepts]: Start accepts. Automaton has 7753 states and 31486 transitions. Word has length 24 [2022-04-18 20:27:04,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:27:04,919 INFO L478 AbstractCegarLoop]: Abstraction has 7753 states and 31486 transitions. [2022-04-18 20:27:04,919 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:04,919 INFO L276 IsEmpty]: Start isEmpty. Operand 7753 states and 31486 transitions. [2022-04-18 20:27:04,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-18 20:27:04,923 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:27:04,924 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:27:04,924 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-18 20:27:04,924 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:27:04,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:27:04,925 INFO L85 PathProgramCache]: Analyzing trace with hash -781660367, now seen corresponding path program 1 times [2022-04-18 20:27:04,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:27:04,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337426345] [2022-04-18 20:27:04,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:27:04,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:27:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:27:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-18 20:27:05,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:27:05,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337426345] [2022-04-18 20:27:05,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337426345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:27:05,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:27:05,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:27:05,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529798053] [2022-04-18 20:27:05,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:27:05,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:27:05,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:27:05,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:27:05,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:27:05,086 INFO L87 Difference]: Start difference. First operand 7753 states and 31486 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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:27:06,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:27:06,024 INFO L93 Difference]: Finished difference Result 9118 states and 37065 transitions. [2022-04-18 20:27:06,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:27:06,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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 25 [2022-04-18 20:27:06,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:27:06,049 INFO L225 Difference]: With dead ends: 9118 [2022-04-18 20:27:06,049 INFO L226 Difference]: Without dead ends: 9118 [2022-04-18 20:27:06,049 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:27:06,050 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 60 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-18 20:27:06,050 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 71 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-18 20:27:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9118 states. [2022-04-18 20:27:06,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9118 to 8563. [2022-04-18 20:27:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8563 states, 8558 states have (on average 4.071628885253564) internal successors, (34845), 8562 states have internal predecessors, (34845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8563 states to 8563 states and 34845 transitions. [2022-04-18 20:27:06,228 INFO L78 Accepts]: Start accepts. Automaton has 8563 states and 34845 transitions. Word has length 25 [2022-04-18 20:27:06,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:27:06,229 INFO L478 AbstractCegarLoop]: Abstraction has 8563 states and 34845 transitions. [2022-04-18 20:27:06,229 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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:27:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand 8563 states and 34845 transitions. [2022-04-18 20:27:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-18 20:27:06,234 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:27:06,234 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] [2022-04-18 20:27:06,234 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-18 20:27:06,235 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:27:06,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:27:06,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1564882616, now seen corresponding path program 1 times [2022-04-18 20:27:06,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:27:06,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355559912] [2022-04-18 20:27:06,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:27:06,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:27:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:27:06,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:27:06,370 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:27:06,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355559912] [2022-04-18 20:27:06,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355559912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:27:06,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:27:06,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:27:06,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680910554] [2022-04-18 20:27:06,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:27:06,371 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:27:06,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:27:06,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:27:06,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:27:06,371 INFO L87 Difference]: Start difference. First operand 8563 states and 34845 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:07,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:27:07,119 INFO L93 Difference]: Finished difference Result 8603 states and 34958 transitions. [2022-04-18 20:27:07,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:27:07,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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:27:07,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:27:07,150 INFO L225 Difference]: With dead ends: 8603 [2022-04-18 20:27:07,150 INFO L226 Difference]: Without dead ends: 6916 [2022-04-18 20:27:07,150 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:27:07,151 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 32 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-18 20:27:07,151 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 80 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-18 20:27:07,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6916 states. [2022-04-18 20:27:07,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6916 to 6916. [2022-04-18 20:27:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6916 states, 6911 states have (on average 4.019534076110548) internal successors, (27779), 6915 states have internal predecessors, (27779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6916 states to 6916 states and 27779 transitions. [2022-04-18 20:27:07,309 INFO L78 Accepts]: Start accepts. Automaton has 6916 states and 27779 transitions. Word has length 28 [2022-04-18 20:27:07,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:27:07,309 INFO L478 AbstractCegarLoop]: Abstraction has 6916 states and 27779 transitions. [2022-04-18 20:27:07,309 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:07,310 INFO L276 IsEmpty]: Start isEmpty. Operand 6916 states and 27779 transitions. [2022-04-18 20:27:07,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-18 20:27:07,315 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:27:07,315 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 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:27:07,315 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-18 20:27:07,315 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:27:07,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:27:07,316 INFO L85 PathProgramCache]: Analyzing trace with hash -446611490, now seen corresponding path program 1 times [2022-04-18 20:27:07,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:27:07,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918383177] [2022-04-18 20:27:07,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:27:07,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:27:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:27:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-18 20:27:07,610 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:27:07,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918383177] [2022-04-18 20:27:07,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918383177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:27:07,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:27:07,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-18 20:27:07,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025372074] [2022-04-18 20:27:07,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:27:07,611 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-18 20:27:07,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:27:07,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-18 20:27:07,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:27:07,612 INFO L87 Difference]: Start difference. First operand 6916 states and 27779 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:09,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:27:09,507 INFO L93 Difference]: Finished difference Result 13296 states and 53151 transitions. [2022-04-18 20:27:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-18 20:27:09,508 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 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 30 [2022-04-18 20:27:09,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:27:09,557 INFO L225 Difference]: With dead ends: 13296 [2022-04-18 20:27:09,558 INFO L226 Difference]: Without dead ends: 12889 [2022-04-18 20:27:09,558 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2022-04-18 20:27:09,559 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 422 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-18 20:27:09,559 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [422 Valid, 146 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-18 20:27:09,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12889 states. [2022-04-18 20:27:09,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12889 to 8272. [2022-04-18 20:27:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8272 states, 8267 states have (on average 4.024192572880126) internal successors, (33268), 8271 states have internal predecessors, (33268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8272 states to 8272 states and 33268 transitions. [2022-04-18 20:27:09,835 INFO L78 Accepts]: Start accepts. Automaton has 8272 states and 33268 transitions. Word has length 30 [2022-04-18 20:27:09,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:27:09,836 INFO L478 AbstractCegarLoop]: Abstraction has 8272 states and 33268 transitions. [2022-04-18 20:27:09,836 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:09,836 INFO L276 IsEmpty]: Start isEmpty. Operand 8272 states and 33268 transitions. [2022-04-18 20:27:09,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-18 20:27:09,843 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:27:09,843 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 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:27:09,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-18 20:27:09,843 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:27:09,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:27:09,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1196612163, now seen corresponding path program 1 times [2022-04-18 20:27:09,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:27:09,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720576250] [2022-04-18 20:27:09,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:27:09,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:27:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:27:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:27:09,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:27:09,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720576250] [2022-04-18 20:27:09,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720576250] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:27:09,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747890528] [2022-04-18 20:27:09,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:27:09,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:27:09,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:27:09,995 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:27:10,000 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:27:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:27:10,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-18 20:27:10,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:27:10,405 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:27:10,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:27:10,556 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:27:10,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747890528] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-18 20:27:10,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-18 20:27:10,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2022-04-18 20:27:10,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698811156] [2022-04-18 20:27:10,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:27:10,557 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:27:10,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:27:10,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:27:10,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-04-18 20:27:10,558 INFO L87 Difference]: Start difference. First operand 8272 states and 33268 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:10,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:27:10,824 INFO L93 Difference]: Finished difference Result 8272 states and 33155 transitions. [2022-04-18 20:27:10,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:27:10,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-04-18 20:27:10,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:27:10,849 INFO L225 Difference]: With dead ends: 8272 [2022-04-18 20:27:10,849 INFO L226 Difference]: Without dead ends: 8272 [2022-04-18 20:27:10,850 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-04-18 20:27:10,850 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 243 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:27:10,850 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 40 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-18 20:27:10,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8272 states. [2022-04-18 20:27:10,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8272 to 8272. [2022-04-18 20:27:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8272 states, 8267 states have (on average 4.010523769202854) internal successors, (33155), 8271 states have internal predecessors, (33155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8272 states to 8272 states and 33155 transitions. [2022-04-18 20:27:11,026 INFO L78 Accepts]: Start accepts. Automaton has 8272 states and 33155 transitions. Word has length 34 [2022-04-18 20:27:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:27:11,027 INFO L478 AbstractCegarLoop]: Abstraction has 8272 states and 33155 transitions. [2022-04-18 20:27:11,027 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 8272 states and 33155 transitions. [2022-04-18 20:27:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-18 20:27:11,035 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:27:11,035 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:27:11,056 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:27:11,247 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,SelfDestructingSolverStorable13 [2022-04-18 20:27:11,247 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:27:11,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:27:11,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1821843223, now seen corresponding path program 1 times [2022-04-18 20:27:11,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:27:11,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438661183] [2022-04-18 20:27:11,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:27:11,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:27:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:27:11,406 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:27:11,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:27:11,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438661183] [2022-04-18 20:27:11,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438661183] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:27:11,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749920253] [2022-04-18 20:27:11,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:27:11,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:27:11,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:27:11,411 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:27:11,436 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:27:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:27:11,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-18 20:27:11,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:27:11,913 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:27:11,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:27:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 20:27:12,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749920253] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:27:12,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [601719330] [2022-04-18 20:27:12,114 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:27:12,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:27:12,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-04-18 20:27:12,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80681047] [2022-04-18 20:27:12,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:27:12,115 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-18 20:27:12,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:27:12,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-18 20:27:12,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-04-18 20:27:12,115 INFO L87 Difference]: Start difference. First operand 8272 states and 33155 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:13,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:27:13,571 INFO L93 Difference]: Finished difference Result 11724 states and 46788 transitions. [2022-04-18 20:27:13,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:27:13,572 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 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 37 [2022-04-18 20:27:13,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:27:13,606 INFO L225 Difference]: With dead ends: 11724 [2022-04-18 20:27:13,607 INFO L226 Difference]: Without dead ends: 11724 [2022-04-18 20:27:13,607 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2022-04-18 20:27:13,607 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 226 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-18 20:27:13,608 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 398 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-18 20:27:13,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11724 states. [2022-04-18 20:27:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11724 to 11446. [2022-04-18 20:27:13,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11446 states, 11441 states have (on average 4.015383270693121) internal successors, (45940), 11445 states have internal predecessors, (45940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11446 states to 11446 states and 45940 transitions. [2022-04-18 20:27:13,831 INFO L78 Accepts]: Start accepts. Automaton has 11446 states and 45940 transitions. Word has length 37 [2022-04-18 20:27:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:27:13,831 INFO L478 AbstractCegarLoop]: Abstraction has 11446 states and 45940 transitions. [2022-04-18 20:27:13,831 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:13,831 INFO L276 IsEmpty]: Start isEmpty. Operand 11446 states and 45940 transitions. [2022-04-18 20:27:13,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-18 20:27:13,844 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:27:13,845 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:27:13,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-18 20:27:14,045 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:27:14,045 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:27:14,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:27:14,045 INFO L85 PathProgramCache]: Analyzing trace with hash -836183163, now seen corresponding path program 2 times [2022-04-18 20:27:14,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:27:14,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102119646] [2022-04-18 20:27:14,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:27:14,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:27:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:27:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-18 20:27:14,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:27:14,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102119646] [2022-04-18 20:27:14,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102119646] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:27:14,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321465244] [2022-04-18 20:27:14,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:27:14,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:27:14,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:27:14,392 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:27:14,393 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:27:14,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:27:14,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:27:14,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-18 20:27:14,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:27:14,711 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:27:14,711 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:27:14,770 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:27:14,770 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-04-18 20:27:14,837 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:27:14,837 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 16 treesize of output 18 [2022-04-18 20:27:15,147 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 15 treesize of output 11 [2022-04-18 20:27:15,253 INFO L356 Elim1Store]: treesize reduction 502, result has 8.6 percent of original size [2022-04-18 20:27:15,253 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 71 [2022-04-18 20:27:15,263 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 68 treesize of output 64 [2022-04-18 20:27:17,247 INFO L356 Elim1Store]: treesize reduction 371, result has 13.7 percent of original size [2022-04-18 20:27:17,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 86 [2022-04-18 20:27:20,099 INFO L356 Elim1Store]: treesize reduction 500, result has 12.4 percent of original size [2022-04-18 20:27:20,100 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:27:22,221 INFO L356 Elim1Store]: treesize reduction 647, result has 11.4 percent of original size [2022-04-18 20:27:22,222 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:27:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-18 20:27:22,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:27:22,325 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse0 (* |thread2Thread1of1ForFork0_~i~1#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 2 .cse0) 0) (+ c_~A~0.offset 3 .cse0) 0))) c_~B~0.base v_ArrVal_3326) c_~C~0.base v_ArrVal_3324) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) is different from false [2022-04-18 20:27:22,416 INFO L356 Elim1Store]: treesize reduction 522, result has 10.9 percent of original size [2022-04-18 20:27:22,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 81 [2022-04-18 20:27:22,431 INFO L356 Elim1Store]: treesize reduction 172, result has 0.6 percent of original size [2022-04-18 20:27:22,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 131 treesize of output 80 [2022-04-18 20:27:22,439 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 52 treesize of output 40 [2022-04-18 20:27:22,443 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 26 treesize of output 20 [2022-04-18 20:27:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-18 20:27:22,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321465244] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:27:22,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1242715086] [2022-04-18 20:27:22,956 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:27:22,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:27:22,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 22 [2022-04-18 20:27:22,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995954600] [2022-04-18 20:27:22,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:27:22,958 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-18 20:27:22,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:27:22,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-18 20:27:22,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=423, Unknown=6, NotChecked=42, Total=552 [2022-04-18 20:27:22,959 INFO L87 Difference]: Start difference. First operand 11446 states and 45940 transitions. Second operand has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:27:24,203 WARN L833 $PredicateComparison]: unable to prove that (and (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select (select |c_#race| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0) (= (+ (- 1) c_thread1Thread1of1ForFork2_~i~0) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse0 (* |thread2Thread1of1ForFork0_~i~1#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 2 .cse0) 0) (+ c_~A~0.offset 3 .cse0) 0))) c_~B~0.base v_ArrVal_3326) c_~C~0.base v_ArrVal_3324) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base))) is different from false [2022-04-18 20:27:30,370 WARN L833 $PredicateComparison]: unable to prove that (and (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select (select |c_#race| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0) (= (+ (- 1) c_thread1Thread1of1ForFork2_~i~0) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse0 (* |thread2Thread1of1ForFork0_~i~1#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 2 .cse0) 0) (+ c_~A~0.offset 3 .cse0) 0))) c_~B~0.base v_ArrVal_3326) c_~C~0.base v_ArrVal_3324) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (= (+ (- 1) |c_thread2Thread1of1ForFork0_~i~1#1|) 0)) is different from false [2022-04-18 20:27:35,661 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset .cse1))) (and (= (select .cse0 (+ c_~A~0.offset .cse1 3)) 0) (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select .cse0 (+ c_~A~0.offset 2 .cse1)) 0) (= (select .cse0 .cse2) 0) (= (+ (- 1) c_thread1Thread1of1ForFork2_~i~0) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select .cse0 (+ c_~A~0.offset .cse1 1)) 0) (forall ((v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse3 (* |thread2Thread1of1ForFork0_~i~1#1| 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_~B~0.base v_ArrVal_3326) c_~C~0.base v_ArrVal_3324) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (not (= (+ c_~A~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4)) .cse2))))) is different from false [2022-04-18 20:27:52,391 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) (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select .cse0 (+ c_~A~0.offset 2 .cse1)) 0) (= (select .cse0 (+ c_~A~0.offset .cse1)) 0) (= (+ (- 1) c_thread1Thread1of1ForFork2_~i~0) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select .cse0 (+ c_~A~0.offset .cse1 1)) 0) (forall ((v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse2 (* |thread2Thread1of1ForFork0_~i~1#1| 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_~B~0.base v_ArrVal_3326) c_~C~0.base v_ArrVal_3324) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)))) is different from false [2022-04-18 20:28:15,034 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_3324 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse0 (* |thread2Thread1of1ForFork0_~i~1#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 2 .cse0) 0) (+ c_~A~0.offset 3 .cse0) 0))) c_~B~0.base v_ArrVal_3326) c_~C~0.base v_ArrVal_3324) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base))) is different from false [2022-04-18 20:28:16,252 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (and (= (select (select |c_#race| c_~A~0.base) .cse0) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse1 (* |thread2Thread1of1ForFork0_~i~1#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 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0))) c_~B~0.base v_ArrVal_3326) c_~C~0.base v_ArrVal_3324) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (not (= (+ c_~A~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4)) .cse0)))) is different from false [2022-04-18 20:28:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:28:16,540 INFO L93 Difference]: Finished difference Result 44514 states and 180746 transitions. [2022-04-18 20:28:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-18 20:28:16,540 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 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 40 [2022-04-18 20:28:16,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:28:16,668 INFO L225 Difference]: With dead ends: 44514 [2022-04-18 20:28:16,668 INFO L226 Difference]: Without dead ends: 44148 [2022-04-18 20:28:16,669 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 57.1s TimeCoverageRelationStatistics Valid=404, Invalid=1481, Unknown=35, NotChecked=630, Total=2550 [2022-04-18 20:28:16,669 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 595 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 5326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3450 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:28:16,669 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [595 Valid, 543 Invalid, 5326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1632 Invalid, 0 Unknown, 3450 Unchecked, 3.1s Time] [2022-04-18 20:28:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44148 states. [2022-04-18 20:28:17,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44148 to 18345. [2022-04-18 20:28:17,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18345 states, 18340 states have (on average 4.093293347873501) internal successors, (75071), 18344 states have internal predecessors, (75071), 0 states have call successors, (0), 0 states have call 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:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18345 states to 18345 states and 75071 transitions. [2022-04-18 20:28:17,398 INFO L78 Accepts]: Start accepts. Automaton has 18345 states and 75071 transitions. Word has length 40 [2022-04-18 20:28:17,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:28:17,399 INFO L478 AbstractCegarLoop]: Abstraction has 18345 states and 75071 transitions. [2022-04-18 20:28:17,399 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call 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:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 18345 states and 75071 transitions. [2022-04-18 20:28:17,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-18 20:28:17,418 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:28:17,418 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:28:17,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-18 20:28:17,619 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:28:17,619 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:28:17,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:28:17,620 INFO L85 PathProgramCache]: Analyzing trace with hash 95081787, now seen corresponding path program 3 times [2022-04-18 20:28:17,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:28:17,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189143518] [2022-04-18 20:28:17,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:28:17,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:28:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:28:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-18 20:28:18,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:28:18,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189143518] [2022-04-18 20:28:18,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189143518] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:28:18,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552202663] [2022-04-18 20:28:18,033 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:28:18,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:28:18,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:28:18,035 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:28:18,035 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:28:18,397 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:28:18,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:28:18,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-18 20:28:18,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:28:18,456 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:28:18,457 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:18,550 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:28:18,550 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-04-18 20:28:18,627 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:28:18,627 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 16 treesize of output 18 [2022-04-18 20:28: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, 2 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:19,199 INFO L356 Elim1Store]: treesize reduction 360, result has 9.8 percent of original size [2022-04-18 20:28:19,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 2 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 60 [2022-04-18 20:28:19,207 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 57 treesize of output 53 [2022-04-18 20:28:19,363 INFO L356 Elim1Store]: treesize reduction 294, result has 14.0 percent of original size [2022-04-18 20:28:19,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 64 treesize of output 75 [2022-04-18 20:28:19,504 INFO L356 Elim1Store]: treesize reduction 412, result has 12.7 percent of original size [2022-04-18 20:28:19,504 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 76 treesize of output 90 [2022-04-18 20:28:19,687 INFO L356 Elim1Store]: treesize reduction 548, result has 11.6 percent of original size [2022-04-18 20:28:19,687 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 88 treesize of output 105 [2022-04-18 20:28:19,754 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-18 20:28:19,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:28:19,824 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3793 (Array Int Int)) (v_ArrVal_3794 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse0 (* |c_thread2Thread1of1ForFork0_~i~1#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_~B~0.base v_ArrVal_3794) c_~C~0.base v_ArrVal_3793) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) is different from false [2022-04-18 20:28:19,918 INFO L356 Elim1Store]: treesize reduction 522, result has 10.9 percent of original size [2022-04-18 20:28:19,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 81 [2022-04-18 20:28:19,929 INFO L356 Elim1Store]: treesize reduction 172, result has 0.6 percent of original size [2022-04-18 20:28:19,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 209 treesize of output 150 [2022-04-18 20:28:19,944 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 90 [2022-04-18 20:28:19,950 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 39 [2022-04-18 20:28:20,464 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-18 20:28:20,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552202663] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:28:20,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [622811873] [2022-04-18 20:28:20,465 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:20,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:28:20,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 9] total 29 [2022-04-18 20:28:20,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414951549] [2022-04-18 20:28:20,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:28:20,467 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-18 20:28:20,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:28:20,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-18 20:28:20,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=751, Unknown=1, NotChecked=56, Total=930 [2022-04-18 20:28:20,470 INFO L87 Difference]: Start difference. First operand 18345 states and 75071 transitions. Second operand has 31 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 30 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call 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:28,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:28:28,082 INFO L93 Difference]: Finished difference Result 44214 states and 181253 transitions. [2022-04-18 20:28:28,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-18 20:28:28,083 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 30 states have internal predecessors, (95), 0 states have call successors, (0), 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 40 [2022-04-18 20:28:28,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:28:28,226 INFO L225 Difference]: With dead ends: 44214 [2022-04-18 20:28:28,226 INFO L226 Difference]: Without dead ends: 43482 [2022-04-18 20:28:28,228 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=876, Invalid=3287, Unknown=1, NotChecked=126, Total=4290 [2022-04-18 20:28:28,228 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 795 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 3264 mSolverCounterSat, 592 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 4410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 592 IncrementalHoareTripleChecker+Valid, 3264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 554 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:28:28,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [795 Valid, 671 Invalid, 4410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [592 Valid, 3264 Invalid, 0 Unknown, 554 Unchecked, 6.0s Time] [2022-04-18 20:28:28,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43482 states. [2022-04-18 20:28:28,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43482 to 10336. [2022-04-18 20:28:28,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10336 states, 10333 states have (on average 4.016258588986742) internal successors, (41500), 10335 states have internal predecessors, (41500), 0 states have call successors, (0), 0 states have call 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:28,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10336 states to 10336 states and 41500 transitions. [2022-04-18 20:28:28,815 INFO L78 Accepts]: Start accepts. Automaton has 10336 states and 41500 transitions. Word has length 40 [2022-04-18 20:28:28,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:28:28,815 INFO L478 AbstractCegarLoop]: Abstraction has 10336 states and 41500 transitions. [2022-04-18 20:28:28,816 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 30 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call 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:28,816 INFO L276 IsEmpty]: Start isEmpty. Operand 10336 states and 41500 transitions. [2022-04-18 20:28:28,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-18 20:28:28,832 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:28:28,832 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 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:28:28,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-18 20:28:29,032 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,7 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:28:29,033 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:28:29,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:28:29,033 INFO L85 PathProgramCache]: Analyzing trace with hash -719114085, now seen corresponding path program 1 times [2022-04-18 20:28:29,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:28:29,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211609894] [2022-04-18 20:28:29,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:28:29,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:28:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:28:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-18 20:28:29,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:28:29,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211609894] [2022-04-18 20:28:29,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211609894] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:28:29,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947049313] [2022-04-18 20:28:29,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:28:29,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:28:29,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:28:29,374 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:28:29,375 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:28:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:28:29,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 94 conjunts are in the unsatisfiable core [2022-04-18 20:28:29,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:28:29,734 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:28:29,734 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:29,792 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:28:29,793 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-04-18 20:28:29,914 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:28:29,914 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 16 treesize of output 18 [2022-04-18 20:28:30,471 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 15 treesize of output 11 [2022-04-18 20:28:30,643 INFO L356 Elim1Store]: treesize reduction 541, result has 10.9 percent of original size [2022-04-18 20:28:30,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, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 93 treesize of output 93 [2022-04-18 20:28:30,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 81 [2022-04-18 20:28:30,855 INFO L356 Elim1Store]: treesize reduction 366, result has 11.6 percent of original size [2022-04-18 20:28:30,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 100 treesize of output 123 [2022-04-18 20:28:31,052 INFO L356 Elim1Store]: treesize reduction 484, result has 11.0 percent of original size [2022-04-18 20:28:31,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 112 treesize of output 138 [2022-04-18 20:28:31,368 INFO L356 Elim1Store]: treesize reduction 620, result has 10.4 percent of original size [2022-04-18 20:28:31,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 34 case distinctions, treesize of input 124 treesize of output 153 [2022-04-18 20:28:31,474 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-18 20:28:31,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:28:31,520 WARN L833 $PredicateComparison]: unable to prove that (forall ((~A~0.offset Int) (v_ArrVal_4289 (Array Int Int))) (= (select (select (store (let ((.cse1 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse1 ~A~0.offset) 0) (+ .cse1 ~A~0.offset 1) 0) (+ .cse1 2 ~A~0.offset) 0) (+ .cse1 3 ~A~0.offset) 0)))) (store .cse0 c_~B~0.base (store (store (store (store (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ .cse1 2 c_~B~0.offset) 0) (+ .cse1 3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_4289) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) is different from false [2022-04-18 20:28:31,923 INFO L356 Elim1Store]: treesize reduction 2962, result has 3.7 percent of original size [2022-04-18 20:28:31,923 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 9 case distinctions, treesize of input 170 treesize of output 129 [2022-04-18 20:28:31,939 INFO L356 Elim1Store]: treesize reduction 684, result has 0.1 percent of original size [2022-04-18 20:28:31,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 144 treesize of output 58 [2022-04-18 20:28:31,948 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:28:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-18 20:28:32,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947049313] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:28:32,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [695732363] [2022-04-18 20:28:32,119 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:32,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:28:32,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 9] total 30 [2022-04-18 20:28:32,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694346388] [2022-04-18 20:28:32,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:28:32,120 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-18 20:28:32,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:28:32,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-18 20:28:32,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=740, Unknown=1, NotChecked=56, Total=930 [2022-04-18 20:28:32,121 INFO L87 Difference]: Start difference. First operand 10336 states and 41500 transitions. Second operand has 31 states, 30 states have (on average 3.6) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call 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:38,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:28:38,233 INFO L93 Difference]: Finished difference Result 28080 states and 115161 transitions. [2022-04-18 20:28:38,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-18 20:28:38,234 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.6) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 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 46 [2022-04-18 20:28:38,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:28:38,319 INFO L225 Difference]: With dead ends: 28080 [2022-04-18 20:28:38,319 INFO L226 Difference]: Without dead ends: 28080 [2022-04-18 20:28:38,320 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=903, Invalid=3132, Unknown=1, NotChecked=124, Total=4160 [2022-04-18 20:28:38,320 INFO L913 BasicCegarLoop]: 91 mSDtfsCounter, 792 mSDsluCounter, 1828 mSDsCounter, 0 mSdLazyCounter, 2579 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 4141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 2579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1211 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-18 20:28:38,321 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [792 Valid, 901 Invalid, 4141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 2579 Invalid, 0 Unknown, 1211 Unchecked, 4.5s Time] [2022-04-18 20:28:38,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28080 states. [2022-04-18 20:28:38,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28080 to 16172. [2022-04-18 20:28:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16172 states, 16169 states have (on average 4.0708763683592055) internal successors, (65822), 16171 states have internal predecessors, (65822), 0 states have call successors, (0), 0 states have call 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:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16172 states to 16172 states and 65822 transitions. [2022-04-18 20:28:38,713 INFO L78 Accepts]: Start accepts. Automaton has 16172 states and 65822 transitions. Word has length 46 [2022-04-18 20:28:38,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:28:38,713 INFO L478 AbstractCegarLoop]: Abstraction has 16172 states and 65822 transitions. [2022-04-18 20:28:38,713 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.6) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call 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:38,713 INFO L276 IsEmpty]: Start isEmpty. Operand 16172 states and 65822 transitions. [2022-04-18 20:28:38,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-18 20:28:38,734 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:28:38,735 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 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:28:38,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-18 20:28:38,935 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,SelfDestructingSolverStorable17 [2022-04-18 20:28:38,935 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:28:38,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:28:38,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1186534875, now seen corresponding path program 2 times [2022-04-18 20:28:38,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:28:38,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135832570] [2022-04-18 20:28:38,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:28:38,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:28:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:28:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-18 20:28:39,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:28:39,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135832570] [2022-04-18 20:28:39,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135832570] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:28:39,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623490077] [2022-04-18 20:28:39,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:28:39,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:28:39,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:28:39,331 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:28:39,332 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:28:39,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:28:39,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:28:39,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 89 conjunts are in the unsatisfiable core [2022-04-18 20:28:39,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:28:39,667 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:28:39,668 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:39,707 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:28:39,707 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-04-18 20:28:39,771 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:28:39,771 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 16 treesize of output 18 [2022-04-18 20:28:40,059 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 15 treesize of output 11 [2022-04-18 20:28:40,107 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-18 20:28:40,107 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 28 treesize of output 27 [2022-04-18 20:28:40,298 INFO L356 Elim1Store]: treesize reduction 1039, result has 8.3 percent of original size [2022-04-18 20:28:40,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 138 treesize of output 130 [2022-04-18 20:28:40,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 113 [2022-04-18 20:28:40,557 INFO L356 Elim1Store]: treesize reduction 605, result has 10.5 percent of original size [2022-04-18 20:28:40,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 134 treesize of output 160 [2022-04-18 20:28:40,847 INFO L356 Elim1Store]: treesize reduction 752, result has 9.9 percent of original size [2022-04-18 20:28:40,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 34 case distinctions, treesize of input 146 treesize of output 175 [2022-04-18 20:28:41,105 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-18 20:28:41,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:28:41,151 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~A~0.offset Int) (v_ArrVal_4789 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (let ((.cse1 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse1) 0) (+ ~A~0.offset .cse1 1) 0) (+ 2 ~A~0.offset .cse1) 0) (+ 3 ~A~0.offset .cse1) 0)))) (store .cse0 c_~B~0.base (store (store (store (store (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ 2 .cse1 c_~B~0.offset) 0) (+ 3 .cse1 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_4789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_4789 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (let ((.cse3 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse3) 0) (+ ~A~0.offset .cse3 1) 0) (+ 2 ~A~0.offset .cse3) 0) (+ 3 ~A~0.offset .cse3) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_4789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0))) is different from false [2022-04-18 20:28:42,112 INFO L356 Elim1Store]: treesize reduction 3897, result has 3.2 percent of original size [2022-04-18 20:28:42,113 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 10 case distinctions, treesize of input 202 treesize of output 142 [2022-04-18 20:28:42,125 INFO L356 Elim1Store]: treesize reduction 855, result has 0.1 percent of original size [2022-04-18 20:28:42,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 157 treesize of output 62 [2022-04-18 20:28:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-18 20:28:42,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623490077] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:28:42,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1843678646] [2022-04-18 20:28:42,270 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:42,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:28:42,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2022-04-18 20:28:42,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550110037] [2022-04-18 20:28:42,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:28:42,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-18 20:28:42,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:28:42,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-18 20:28:42,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=542, Unknown=9, NotChecked=48, Total=702 [2022-04-18 20:28:42,272 INFO L87 Difference]: Start difference. First operand 16172 states and 65822 transitions. Second operand has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 27 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call 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:44,632 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~B~0.base)) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (= (select .cse0 (+ .cse1 c_~B~0.offset)) 0) (forall ((~A~0.offset Int) (v_ArrVal_4789 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (let ((.cse3 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse3) 0) (+ ~A~0.offset .cse3 1) 0) (+ 2 ~A~0.offset .cse3) 0) (+ 3 ~A~0.offset .cse3) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_4789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= (+ (- 1) c_thread1Thread1of1ForFork2_~i~0) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select .cse0 (+ .cse1 c_~B~0.offset 1)) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (= (select |c_#valid| c_~A~0.base) 1) (forall ((~A~0.offset Int) (v_ArrVal_4789 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (let ((.cse5 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse5) 0) (+ ~A~0.offset .cse5 1) 0) (+ 2 ~A~0.offset .cse5) 0) (+ 3 ~A~0.offset .cse5) 0)))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ 2 .cse5 c_~B~0.offset) 0) (+ 3 .cse5 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_4789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0)))) is different from false [2022-04-18 20:28:46,787 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~B~0.base)) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (= (select .cse0 (+ .cse1 c_~B~0.offset)) 0) (forall ((~A~0.offset Int) (v_ArrVal_4789 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (let ((.cse3 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse3) 0) (+ ~A~0.offset .cse3 1) 0) (+ 2 ~A~0.offset .cse3) 0) (+ 3 ~A~0.offset .cse3) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_4789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= (+ (- 1) c_thread1Thread1of1ForFork2_~i~0) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select .cse0 (+ .cse1 c_~B~0.offset 1)) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (= (select |c_#valid| c_~A~0.base) 1) (= (+ (- 1) |c_thread2Thread1of1ForFork0_~i~1#1|) 0) (forall ((~A~0.offset Int) (v_ArrVal_4789 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (let ((.cse5 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse5) 0) (+ ~A~0.offset .cse5 1) 0) (+ 2 ~A~0.offset .cse5) 0) (+ 3 ~A~0.offset .cse5) 0)))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ 2 .cse5 c_~B~0.offset) 0) (+ 3 .cse5 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_4789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0)))) is different from false [2022-04-18 20:28:48,990 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~B~0.base)) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (= (select .cse0 (+ .cse1 c_~B~0.offset)) 0) (forall ((~A~0.offset Int) (v_ArrVal_4789 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (let ((.cse3 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse3) 0) (+ ~A~0.offset .cse3 1) 0) (+ 2 ~A~0.offset .cse3) 0) (+ 3 ~A~0.offset .cse3) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_4789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= (+ (- 1) c_thread1Thread1of1ForFork2_~i~0) 0) (not (= 0 (+ c_thread1Thread1of1ForFork2_~i~0 (* (- 1) |c_thread2Thread1of1ForFork0_~i~1#1|)))) (not (= c_~C~0.base c_~A~0.base)) (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select .cse0 (+ .cse1 c_~B~0.offset 1)) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (= (select |c_#valid| c_~A~0.base) 1) (forall ((~A~0.offset Int) (v_ArrVal_4789 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (let ((.cse5 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse5) 0) (+ ~A~0.offset .cse5 1) 0) (+ 2 ~A~0.offset .cse5) 0) (+ 3 ~A~0.offset .cse5) 0)))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ 2 .cse5 c_~B~0.offset) 0) (+ 3 .cse5 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_4789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0)))) is different from false [2022-04-18 20:28:54,013 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~B~0.base)) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (= (select .cse0 (+ .cse1 c_~B~0.offset)) 0) (forall ((~A~0.offset Int) (v_ArrVal_4789 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (let ((.cse3 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse3) 0) (+ ~A~0.offset .cse3 1) 0) (+ 2 ~A~0.offset .cse3) 0) (+ 3 ~A~0.offset .cse3) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_4789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 (+ .cse1 c_~B~0.offset 1)) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (forall ((~A~0.offset Int) (v_ArrVal_4789 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (let ((.cse5 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse5) 0) (+ ~A~0.offset .cse5 1) 0) (+ 2 ~A~0.offset .cse5) 0) (+ 3 ~A~0.offset .cse5) 0)))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ 2 .cse5 c_~B~0.offset) 0) (+ 3 .cse5 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_4789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0)))) is different from false [2022-04-18 20:28:56,249 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~B~0.base)) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (= (select .cse0 (+ .cse1 c_~B~0.offset)) 0) (forall ((~A~0.offset Int) (v_ArrVal_4789 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (let ((.cse3 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse3) 0) (+ ~A~0.offset .cse3 1) 0) (+ 2 ~A~0.offset .cse3) 0) (+ 3 ~A~0.offset .cse3) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_4789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (not (= 0 (+ c_thread1Thread1of1ForFork2_~i~0 (* (- 1) |c_thread2Thread1of1ForFork0_~i~1#1|)))) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 (+ .cse1 c_~B~0.offset 1)) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (forall ((~A~0.offset Int) (v_ArrVal_4789 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (let ((.cse5 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse5) 0) (+ ~A~0.offset .cse5 1) 0) (+ 2 ~A~0.offset .cse5) 0) (+ 3 ~A~0.offset .cse5) 0)))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ 2 .cse5 c_~B~0.offset) 0) (+ 3 .cse5 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_4789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0)))) is different from false [2022-04-18 20:28:58,497 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~B~0.base)) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (= (select .cse0 (+ .cse1 c_~B~0.offset)) 0) (forall ((~A~0.offset Int) (v_ArrVal_4789 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (let ((.cse3 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse3) 0) (+ ~A~0.offset .cse3 1) 0) (+ 2 ~A~0.offset .cse3) 0) (+ 3 ~A~0.offset .cse3) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_4789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (not (= c_~C~0.base c_~A~0.base)) (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select .cse0 (+ .cse1 c_~B~0.offset 1)) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (= (select |c_#valid| c_~A~0.base) 1) (forall ((~A~0.offset Int) (v_ArrVal_4789 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (let ((.cse5 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse5) 0) (+ ~A~0.offset .cse5 1) 0) (+ 2 ~A~0.offset .cse5) 0) (+ 3 ~A~0.offset .cse5) 0)))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ 2 .cse5 c_~B~0.offset) 0) (+ 3 .cse5 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_4789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0)))) is different from false [2022-04-18 20:29:00,563 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~B~0.base)) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (= (select .cse0 (+ .cse1 c_~B~0.offset)) 0) (forall ((~A~0.offset Int) (v_ArrVal_4789 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (let ((.cse3 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse3) 0) (+ ~A~0.offset .cse3 1) 0) (+ 2 ~A~0.offset .cse3) 0) (+ 3 ~A~0.offset .cse3) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_4789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (not (= 0 (+ c_thread1Thread1of1ForFork2_~i~0 (* (- 1) |c_thread2Thread1of1ForFork0_~i~1#1|)))) (not (= c_~C~0.base c_~A~0.base)) (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select .cse0 (+ .cse1 c_~B~0.offset 1)) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (= (select |c_#valid| c_~A~0.base) 1) (forall ((~A~0.offset Int) (v_ArrVal_4789 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (let ((.cse5 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse5) 0) (+ ~A~0.offset .cse5 1) 0) (+ 2 ~A~0.offset .cse5) 0) (+ 3 ~A~0.offset .cse5) 0)))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ 2 .cse5 c_~B~0.offset) 0) (+ 3 .cse5 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_4789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0)))) is different from false [2022-04-18 20:29:01,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:29:01,033 INFO L93 Difference]: Finished difference Result 68831 states and 282839 transitions. [2022-04-18 20:29:01,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-18 20:29:01,034 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 27 states have internal predecessors, (99), 0 states have call successors, (0), 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 46 [2022-04-18 20:29:01,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:29:01,253 INFO L225 Difference]: With dead ends: 68831 [2022-04-18 20:29:01,253 INFO L226 Difference]: Without dead ends: 68831 [2022-04-18 20:29:01,254 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=1004, Invalid=3704, Unknown=16, NotChecked=1128, Total=5852 [2022-04-18 20:29:01,254 INFO L913 BasicCegarLoop]: 103 mSDtfsCounter, 728 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 4462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2120 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-18 20:29:01,255 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [728 Valid, 861 Invalid, 4462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2138 Invalid, 0 Unknown, 2120 Unchecked, 3.4s Time] [2022-04-18 20:29:01,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68831 states. [2022-04-18 20:29:01,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68831 to 29721. [2022-04-18 20:29:02,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29721 states, 29718 states have (on average 4.137963523790296) internal successors, (122972), 29720 states have internal predecessors, (122972), 0 states have call successors, (0), 0 states have call 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,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29721 states to 29721 states and 122972 transitions. [2022-04-18 20:29:02,125 INFO L78 Accepts]: Start accepts. Automaton has 29721 states and 122972 transitions. Word has length 46 [2022-04-18 20:29:02,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:29:02,125 INFO L478 AbstractCegarLoop]: Abstraction has 29721 states and 122972 transitions. [2022-04-18 20:29:02,125 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 27 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call 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,126 INFO L276 IsEmpty]: Start isEmpty. Operand 29721 states and 122972 transitions. [2022-04-18 20:29:02,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-18 20:29:02,162 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:29:02,162 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 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:02,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-18 20:29:02,367 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:29:02,367 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:29:02,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:29:02,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1416931645, now seen corresponding path program 3 times [2022-04-18 20:29:02,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:29:02,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375909439] [2022-04-18 20:29:02,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:29:02,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:29:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:29:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-18 20:29:02,873 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:29:02,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375909439] [2022-04-18 20:29:02,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375909439] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:29:02,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873311857] [2022-04-18 20:29:02,873 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:29:02,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:29:02,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:29:02,875 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:29:02,907 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:29:03,321 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:29:03,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:29:03,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 94 conjunts are in the unsatisfiable core [2022-04-18 20:29:03,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:29:03,398 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:29:03,399 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:03,472 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:29:03,473 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-04-18 20:29:03,578 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:29:03,578 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 16 treesize of output 18 [2022-04-18 20:29:04,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-18 20:29:04,070 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-18 20:29:04,071 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 28 treesize of output 27 [2022-04-18 20:29:04,304 INFO L356 Elim1Store]: treesize reduction 755, result has 9.4 percent of original size [2022-04-18 20:29:04,305 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 105 treesize of output 108 [2022-04-18 20:29:04,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 91 [2022-04-18 20:29:04,517 INFO L356 Elim1Store]: treesize reduction 484, result has 11.0 percent of original size [2022-04-18 20:29:04,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 112 treesize of output 138 [2022-04-18 20:29:04,732 INFO L356 Elim1Store]: treesize reduction 620, result has 10.4 percent of original size [2022-04-18 20:29:04,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 34 case distinctions, treesize of input 124 treesize of output 153 [2022-04-18 20:29:04,847 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-18 20:29:04,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:29:04,914 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~A~0.offset Int) (v_ArrVal_5277 (Array Int Int))) (= 0 (select (select (store (let ((.cse1 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse1 ~A~0.offset) 0) (+ .cse1 ~A~0.offset 1) 0) (+ .cse1 2 ~A~0.offset) 0) (+ .cse1 3 ~A~0.offset) 0)))) (store .cse0 c_~B~0.base (store (store (store (store (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ .cse1 2 c_~B~0.offset) 0) (+ .cse1 3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_5277) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)))) (forall ((~A~0.offset Int) (v_ArrVal_5277 (Array Int Int))) (= (select (select (store (let ((.cse3 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse3 ~A~0.offset) 0) (+ .cse3 ~A~0.offset 1) 0) (+ .cse3 2 ~A~0.offset) 0) (+ .cse3 3 ~A~0.offset) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ .cse3 2 c_~B~0.offset) 0) (+ .cse3 3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_5277) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0))) is different from false [2022-04-18 20:29:05,000 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~A~0.offset Int) (v_ArrVal_5277 (Array Int Int))) (= (let ((.cse3 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1))) (select (select (store (let ((.cse1 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse0 (let ((.cse2 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse3 0)))) (store .cse2 c_~A~0.base (store (store (store (store (select .cse2 c_~A~0.base) (+ .cse1 ~A~0.offset) 0) (+ .cse1 ~A~0.offset 1) 0) (+ .cse1 2 ~A~0.offset) 0) (+ .cse1 3 ~A~0.offset) 0))))) (store .cse0 c_~B~0.base (store (store (store (store (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ .cse1 2 c_~B~0.offset) 0) (+ .cse1 3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_5277) c_~B~0.base) .cse3)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_5277 (Array Int Int))) (= (let ((.cse7 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (let ((.cse5 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse4 (let ((.cse6 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ .cse7 c_~B~0.offset 1) 0)))) (store .cse6 c_~A~0.base (store (store (store (store (select .cse6 c_~A~0.base) (+ .cse5 ~A~0.offset) 0) (+ .cse5 ~A~0.offset 1) 0) (+ .cse5 2 ~A~0.offset) 0) (+ .cse5 3 ~A~0.offset) 0))))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ .cse5 2 c_~B~0.offset) 0) (+ .cse5 3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_5277) c_~B~0.base) (+ .cse7 c_~B~0.offset))) 0))) is different from false [2022-04-18 20:29:05,538 INFO L356 Elim1Store]: treesize reduction 3897, result has 3.2 percent of original size [2022-04-18 20:29:05,539 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 10 case distinctions, treesize of input 203 treesize of output 143 [2022-04-18 20:29:05,548 INFO L356 Elim1Store]: treesize reduction 855, result has 0.1 percent of original size [2022-04-18 20:29:05,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 159 treesize of output 63 [2022-04-18 20:29:05,554 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:05,836 INFO L356 Elim1Store]: treesize reduction 4024, result has 0.0 percent of original size [2022-04-18 20:29:05,836 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 10 case distinctions, treesize of input 202 treesize of output 1 [2022-04-18 20:29:05,955 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 1 not checked. [2022-04-18 20:29:05,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873311857] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:29:05,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [450070867] [2022-04-18 20:29:05,957 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:05,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:29:05,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 9] total 31 [2022-04-18 20:29:05,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913715531] [2022-04-18 20:29:05,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:29:05,958 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-18 20:29:05,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:29:05,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-18 20:29:05,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=739, Unknown=2, NotChecked=114, Total=992 [2022-04-18 20:29:05,959 INFO L87 Difference]: Start difference. First operand 29721 states and 122972 transitions. Second operand has 32 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 32 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:15,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:29:15,848 INFO L93 Difference]: Finished difference Result 70529 states and 292517 transitions. [2022-04-18 20:29:15,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-18 20:29:15,848 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 32 states have internal predecessors, (111), 0 states have call successors, (0), 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 46 [2022-04-18 20:29:15,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:29:16,073 INFO L225 Difference]: With dead ends: 70529 [2022-04-18 20:29:16,073 INFO L226 Difference]: Without dead ends: 70122 [2022-04-18 20:29:16,074 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 76 SyntacticMatches, 10 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=493, Invalid=2375, Unknown=2, NotChecked=210, Total=3080 [2022-04-18 20:29:16,075 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 790 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 4762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2340 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:29:16,075 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [790 Valid, 840 Invalid, 4762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 2156 Invalid, 0 Unknown, 2340 Unchecked, 4.0s Time] [2022-04-18 20:29:16,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70122 states. [2022-04-18 20:29:17,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70122 to 47423. [2022-04-18 20:29:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47423 states, 47420 states have (on average 4.170645297342893) internal successors, (197772), 47422 states have internal predecessors, (197772), 0 states have call successors, (0), 0 states have call 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:17,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47423 states to 47423 states and 197772 transitions. [2022-04-18 20:29:17,494 INFO L78 Accepts]: Start accepts. Automaton has 47423 states and 197772 transitions. Word has length 46 [2022-04-18 20:29:17,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:29:17,494 INFO L478 AbstractCegarLoop]: Abstraction has 47423 states and 197772 transitions. [2022-04-18 20:29:17,495 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 32 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:17,495 INFO L276 IsEmpty]: Start isEmpty. Operand 47423 states and 197772 transitions. [2022-04-18 20:29:17,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-18 20:29:17,549 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:29:17,549 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 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:17,567 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:29:17,749 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:29:17,749 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:29:17,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:29:17,750 INFO L85 PathProgramCache]: Analyzing trace with hash -252662619, now seen corresponding path program 4 times [2022-04-18 20:29:17,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:29:17,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32816017] [2022-04-18 20:29:17,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:29:17,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:29:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:29:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-18 20:29:18,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:29:18,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32816017] [2022-04-18 20:29:18,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32816017] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:29:18,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244065807] [2022-04-18 20:29:18,101 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-18 20:29:18,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:29:18,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:29:18,104 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:29:18,113 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:29:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:29:18,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 92 conjunts are in the unsatisfiable core [2022-04-18 20:29:18,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:29:18,512 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:29:18,513 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:18,552 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:29:18,552 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-04-18 20:29:18,611 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:29:18,611 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 16 treesize of output 18 [2022-04-18 20:29:18,973 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 15 treesize of output 11 [2022-04-18 20:29:19,059 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-18 20:29:19,059 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 28 treesize of output 27 [2022-04-18 20:29:19,343 INFO L356 Elim1Store]: treesize reduction 1039, result has 8.3 percent of original size [2022-04-18 20:29:19,344 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 138 treesize of output 130 [2022-04-18 20:29:19,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 0 case distinctions, treesize of input 124 treesize of output 113 [2022-04-18 20:29:19,589 INFO L356 Elim1Store]: treesize reduction 605, result has 10.5 percent of original size [2022-04-18 20:29:19,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 134 treesize of output 160 [2022-04-18 20:29:19,934 INFO L356 Elim1Store]: treesize reduction 752, result has 9.9 percent of original size [2022-04-18 20:29:19,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 34 case distinctions, treesize of input 146 treesize of output 175 [2022-04-18 20:29:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-18 20:29:20,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:29:20,180 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~A~0.offset Int) (v_ArrVal_5789 (Array Int Int))) (= (select (select (store (let ((.cse1 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse1 ~A~0.offset) 0) (+ .cse1 ~A~0.offset 1) 0) (+ .cse1 2 ~A~0.offset) 0) (+ .cse1 3 ~A~0.offset) 0)))) (store .cse0 c_~B~0.base (store (store (store (store (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ .cse1 2 c_~B~0.offset) 0) (+ .cse1 3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_5789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_5789 (Array Int Int))) (= (select (select (store (let ((.cse3 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse3 ~A~0.offset) 0) (+ .cse3 ~A~0.offset 1) 0) (+ .cse3 2 ~A~0.offset) 0) (+ .cse3 3 ~A~0.offset) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ .cse3 2 c_~B~0.offset) 0) (+ .cse3 3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_5789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0))) is different from false [2022-04-18 20:29:20,295 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork0_~i~1#1_1529| Int)) (or (and (forall ((~A~0.offset Int) (v_ArrVal_5789 (Array Int Int))) (= (select (select (store (let ((.cse1 (* |v_thread2Thread1of1ForFork0_~i~1#1_1529| 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse1 ~A~0.offset) 0) (+ .cse1 ~A~0.offset 1) 0) (+ .cse1 2 ~A~0.offset) 0) (+ .cse1 3 ~A~0.offset) 0)))) (store .cse0 c_~B~0.base (store (store (store (store (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ .cse1 2 c_~B~0.offset) 0) (+ .cse1 3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_5789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_5789 (Array Int Int))) (= (select (select (store (let ((.cse3 (* |v_thread2Thread1of1ForFork0_~i~1#1_1529| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse3 ~A~0.offset) 0) (+ .cse3 ~A~0.offset 1) 0) (+ .cse3 2 ~A~0.offset) 0) (+ .cse3 3 ~A~0.offset) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ .cse3 2 c_~B~0.offset) 0) (+ .cse3 3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_5789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0))) (not (<= |v_thread2Thread1of1ForFork0_~i~1#1_1529| 1)))) is different from false [2022-04-18 20:29:20,482 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork0_~i~1#1_1529| Int)) (or (not (<= |v_thread2Thread1of1ForFork0_~i~1#1_1529| 1)) (and (forall ((~A~0.offset Int) (v_ArrVal_5789 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (let ((.cse1 (* |v_thread2Thread1of1ForFork0_~i~1#1_1529| 4))) (let ((.cse0 (let ((.cse2 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ .cse3 c_~B~0.offset 1) 0)))) (store .cse2 c_~A~0.base (store (store (store (store (select .cse2 c_~A~0.base) (+ .cse1 ~A~0.offset) 0) (+ .cse1 ~A~0.offset 1) 0) (+ .cse1 2 ~A~0.offset) 0) (+ .cse1 3 ~A~0.offset) 0))))) (store .cse0 c_~B~0.base (store (store (store (store (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ .cse1 2 c_~B~0.offset) 0) (+ .cse1 3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_5789) c_~B~0.base) (+ .cse3 c_~B~0.offset))) 0)) (forall ((~A~0.offset Int) (v_ArrVal_5789 (Array Int Int))) (= 0 (let ((.cse7 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1))) (select (select (store (let ((.cse5 (* |v_thread2Thread1of1ForFork0_~i~1#1_1529| 4))) (let ((.cse4 (let ((.cse6 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse7 0)))) (store .cse6 c_~A~0.base (store (store (store (store (select .cse6 c_~A~0.base) (+ .cse5 ~A~0.offset) 0) (+ .cse5 ~A~0.offset 1) 0) (+ .cse5 2 ~A~0.offset) 0) (+ .cse5 3 ~A~0.offset) 0))))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ .cse5 2 c_~B~0.offset) 0) (+ .cse5 3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_5789) c_~B~0.base) .cse7))))))) is different from false [2022-04-18 20:29:21,329 INFO L356 Elim1Store]: treesize reduction 3897, result has 3.2 percent of original size [2022-04-18 20:29:21,329 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 10 case distinctions, treesize of input 203 treesize of output 143 [2022-04-18 20:29:21,341 INFO L356 Elim1Store]: treesize reduction 855, result has 0.1 percent of original size [2022-04-18 20:29:21,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 159 treesize of output 63 [2022-04-18 20:29:21,345 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:21,624 INFO L356 Elim1Store]: treesize reduction 4024, result has 0.0 percent of original size [2022-04-18 20:29:21,624 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 10 case distinctions, treesize of input 202 treesize of output 1 [2022-04-18 20:29:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 1 not checked. [2022-04-18 20:29:21,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244065807] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:29:21,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [255287341] [2022-04-18 20:29:21,751 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:21,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:29:21,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 30 [2022-04-18 20:29:21,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049661382] [2022-04-18 20:29:21,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:29:21,752 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-18 20:29:21,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:29:21,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-18 20:29:21,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=630, Unknown=3, NotChecked=162, Total=930 [2022-04-18 20:29:21,753 INFO L87 Difference]: Start difference. First operand 47423 states and 197772 transitions. Second operand has 31 states, 30 states have (on average 3.566666666666667) internal successors, (107), 31 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:29:25,291 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_thread2Thread1of1ForFork0_~i~1#1_1529| Int)) (or (and (forall ((~A~0.offset Int) (v_ArrVal_5789 (Array Int Int))) (= (select (select (store (let ((.cse1 (* |v_thread2Thread1of1ForFork0_~i~1#1_1529| 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse1 ~A~0.offset) 0) (+ .cse1 ~A~0.offset 1) 0) (+ .cse1 2 ~A~0.offset) 0) (+ .cse1 3 ~A~0.offset) 0)))) (store .cse0 c_~B~0.base (store (store (store (store (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ .cse1 2 c_~B~0.offset) 0) (+ .cse1 3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_5789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_5789 (Array Int Int))) (= (select (select (store (let ((.cse3 (* |v_thread2Thread1of1ForFork0_~i~1#1_1529| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse3 ~A~0.offset) 0) (+ .cse3 ~A~0.offset 1) 0) (+ .cse3 2 ~A~0.offset) 0) (+ .cse3 3 ~A~0.offset) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ .cse3 2 c_~B~0.offset) 0) (+ .cse3 3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_5789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0))) (not (<= |v_thread2Thread1of1ForFork0_~i~1#1_1529| 1)))) (= (+ (- 1) c_thread1Thread1of1ForFork2_~i~0) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (<= 1 c_thread1Thread1of1ForFork2_~i~0)) is different from false [2022-04-18 20:29:42,306 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~B~0.base)) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (= (select .cse0 (+ .cse1 c_~B~0.offset)) 0) (forall ((|v_thread2Thread1of1ForFork0_~i~1#1_1529| Int)) (or (and (forall ((~A~0.offset Int) (v_ArrVal_5789 (Array Int Int))) (= (select (select (store (let ((.cse3 (* |v_thread2Thread1of1ForFork0_~i~1#1_1529| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse3 ~A~0.offset) 0) (+ .cse3 ~A~0.offset 1) 0) (+ .cse3 2 ~A~0.offset) 0) (+ .cse3 3 ~A~0.offset) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ .cse3 2 c_~B~0.offset) 0) (+ .cse3 3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_5789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_5789 (Array Int Int))) (= (select (select (store (let ((.cse5 (* |v_thread2Thread1of1ForFork0_~i~1#1_1529| 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse5 ~A~0.offset) 0) (+ .cse5 ~A~0.offset 1) 0) (+ .cse5 2 ~A~0.offset) 0) (+ .cse5 3 ~A~0.offset) 0)))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ .cse5 2 c_~B~0.offset) 0) (+ .cse5 3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_5789) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0))) (not (<= |v_thread2Thread1of1ForFork0_~i~1#1_1529| 1)))) (not (= c_~C~0.base c_~A~0.base)) (<= 2 c_thread1Thread1of1ForFork2_~i~0) (= (select .cse0 (+ .cse1 c_~B~0.offset 1)) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)))) is different from false [2022-04-18 20:29:45,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:29:45,187 INFO L93 Difference]: Finished difference Result 89649 states and 374802 transitions. [2022-04-18 20:29:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-18 20:29:45,187 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.566666666666667) internal successors, (107), 31 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 46 [2022-04-18 20:29:45,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:29:45,569 INFO L225 Difference]: With dead ends: 89649 [2022-04-18 20:29:45,569 INFO L226 Difference]: Without dead ends: 89538 [2022-04-18 20:29:45,569 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=375, Invalid=1532, Unknown=5, NotChecked=440, Total=2352 [2022-04-18 20:29:45,570 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 688 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 2329 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 5354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2881 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-18 20:29:45,570 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [688 Valid, 803 Invalid, 5354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2329 Invalid, 0 Unknown, 2881 Unchecked, 5.3s Time] [2022-04-18 20:29:45,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89538 states. [2022-04-18 20:29:47,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89538 to 50496. [2022-04-18 20:29:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50496 states, 50493 states have (on average 4.1741825599588065) internal successors, (210767), 50495 states have internal predecessors, (210767), 0 states have call successors, (0), 0 states have call 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:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50496 states to 50496 states and 210767 transitions. [2022-04-18 20:29:47,578 INFO L78 Accepts]: Start accepts. Automaton has 50496 states and 210767 transitions. Word has length 46 [2022-04-18 20:29:47,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:29:47,579 INFO L478 AbstractCegarLoop]: Abstraction has 50496 states and 210767 transitions. [2022-04-18 20:29:47,579 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.566666666666667) internal successors, (107), 31 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:29:47,579 INFO L276 IsEmpty]: Start isEmpty. Operand 50496 states and 210767 transitions. [2022-04-18 20:29:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-18 20:29:47,655 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:29:47,655 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 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:47,683 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:29:47,871 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-18 20:29:47,871 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:29:47,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:29:47,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1975168847, now seen corresponding path program 5 times [2022-04-18 20:29:47,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:29:47,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475158352] [2022-04-18 20:29:47,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:29:47,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:29:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:29:48,289 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-18 20:29:48,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:29:48,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475158352] [2022-04-18 20:29:48,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475158352] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:29:48,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068772715] [2022-04-18 20:29:48,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:29:48,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:29:48,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:29:48,291 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:29:48,292 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:29:48,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:29:48,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:29:48,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-18 20:29:48,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:29:48,713 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:29:48,713 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:48,767 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:29:48,768 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-04-18 20:29:48,848 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:29:48,848 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 16 treesize of output 18 [2022-04-18 20:29:49,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, 2 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:49,278 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-18 20:29:49,279 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 28 treesize of output 27 [2022-04-18 20:29:49,678 INFO L356 Elim1Store]: treesize reduction 1039, result has 8.3 percent of original size [2022-04-18 20:29:49,679 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 138 treesize of output 130 [2022-04-18 20:29:49,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 113 [2022-04-18 20:29:49,965 INFO L356 Elim1Store]: treesize reduction 605, result has 10.5 percent of original size [2022-04-18 20:29:49,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 134 treesize of output 160 [2022-04-18 20:29:50,275 INFO L356 Elim1Store]: treesize reduction 752, result has 9.9 percent of original size [2022-04-18 20:29:50,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 34 case distinctions, treesize of input 146 treesize of output 175 [2022-04-18 20:29:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-18 20:29:50,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:29:50,493 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~A~0.offset Int) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6273 (Array Int Int))) (= (select (select (store (let ((.cse1 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse1) 0) (+ ~A~0.offset .cse1 1) 0) (+ 2 ~A~0.offset .cse1) 0) (+ 3 ~A~0.offset .cse1) 0)))) (store .cse0 c_~B~0.base (store (store (store (store (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ 2 .cse1 c_~B~0.offset) 0) (+ 3 .cse1 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_6273) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0)) (forall ((~A~0.offset Int) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6273 (Array Int Int))) (= (select (select (store (let ((.cse3 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse3) 0) (+ ~A~0.offset .cse3 1) 0) (+ 2 ~A~0.offset .cse3) 0) (+ 3 ~A~0.offset .cse3) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_6273) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0))) is different from false [2022-04-18 20:29:51,869 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~A~0.offset Int) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6273 (Array Int Int))) (= (let ((.cse3 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1))) (select (select (store (let ((.cse1 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse0 (let ((.cse2 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse3 0)))) (store .cse2 c_~A~0.base (store (store (store (store (select .cse2 c_~A~0.base) (+ ~A~0.offset .cse1) 0) (+ ~A~0.offset .cse1 1) 0) (+ 2 ~A~0.offset .cse1) 0) (+ 3 ~A~0.offset .cse1) 0))))) (store .cse0 c_~B~0.base (store (store (store (store (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ 2 .cse1 c_~B~0.offset) 0) (+ 3 .cse1 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_6273) c_~B~0.base) .cse3)) 0)) (forall ((~A~0.offset Int) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6273 (Array Int Int))) (= (let ((.cse7 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (let ((.cse5 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse4 (let ((.cse6 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ .cse7 c_~B~0.offset 1) 0)))) (store .cse6 c_~A~0.base (store (store (store (store (select .cse6 c_~A~0.base) (+ ~A~0.offset .cse5) 0) (+ ~A~0.offset .cse5 1) 0) (+ 2 ~A~0.offset .cse5) 0) (+ 3 ~A~0.offset .cse5) 0))))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ 2 .cse5 c_~B~0.offset) 0) (+ 3 .cse5 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_6273) c_~B~0.base) (+ .cse7 c_~B~0.offset))) 0))) is different from false [2022-04-18 20:29:52,633 INFO L356 Elim1Store]: treesize reduction 3897, result has 3.2 percent of original size [2022-04-18 20:29:52,633 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 10 case distinctions, treesize of input 203 treesize of output 143 [2022-04-18 20:29:52,643 INFO L356 Elim1Store]: treesize reduction 855, result has 0.1 percent of original size [2022-04-18 20:29:52,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 159 treesize of output 63 [2022-04-18 20:29:52,967 INFO L356 Elim1Store]: treesize reduction 4024, result has 0.0 percent of original size [2022-04-18 20:29:52,967 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 10 case distinctions, treesize of input 202 treesize of output 1 [2022-04-18 20:29:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 1 not checked. [2022-04-18 20:29:53,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068772715] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:29:53,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [771687736] [2022-04-18 20:29:53,100 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:53,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:29:53,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2022-04-18 20:29:53,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973327756] [2022-04-18 20:29:53,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:29:53,104 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-18 20:29:53,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:29:53,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-18 20:29:53,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=510, Unknown=2, NotChecked=94, Total=702 [2022-04-18 20:29:53,105 INFO L87 Difference]: Start difference. First operand 50496 states and 210767 transitions. Second operand has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 27 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call 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:56,776 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~B~0.base)) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (= (select .cse0 (+ .cse1 c_~B~0.offset)) 0) (= (+ (- 1) c_thread1Thread1of1ForFork2_~i~0) 0) (forall ((~A~0.offset Int) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6273 (Array Int Int))) (= (select (select (store (let ((.cse3 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse3) 0) (+ ~A~0.offset .cse3 1) 0) (+ 2 ~A~0.offset .cse3) 0) (+ 3 ~A~0.offset .cse3) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_6273) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0)) (not (= c_~C~0.base c_~A~0.base)) (forall ((~A~0.offset Int) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6273 (Array Int Int))) (= (select (select (store (let ((.cse5 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse5) 0) (+ ~A~0.offset .cse5 1) 0) (+ 2 ~A~0.offset .cse5) 0) (+ 3 ~A~0.offset .cse5) 0)))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ 2 .cse5 c_~B~0.offset) 0) (+ 3 .cse5 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_6273) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (= (select .cse0 (+ .cse1 c_~B~0.offset 1)) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)))) is different from false [2022-04-18 20:29:59,036 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~B~0.base)) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (= (select .cse0 (+ .cse1 c_~B~0.offset)) 0) (forall ((~A~0.offset Int) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6273 (Array Int Int))) (= (select (select (store (let ((.cse3 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse3) 0) (+ ~A~0.offset .cse3 1) 0) (+ 2 ~A~0.offset .cse3) 0) (+ 3 ~A~0.offset .cse3) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_6273) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0)) (not (= c_~C~0.base c_~A~0.base)) (forall ((~A~0.offset Int) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6273 (Array Int Int))) (= (select (select (store (let ((.cse5 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse5) 0) (+ ~A~0.offset .cse5 1) 0) (+ 2 ~A~0.offset .cse5) 0) (+ 3 ~A~0.offset .cse5) 0)))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ 2 .cse5 c_~B~0.offset) 0) (+ 3 .cse5 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_6273) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (= (select .cse0 (+ .cse1 c_~B~0.offset 1)) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)))) is different from false [2022-04-18 20:30:03,393 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#race| c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0) (forall ((~A~0.offset Int) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6273 (Array Int Int))) (= (let ((.cse3 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1))) (select (select (store (let ((.cse1 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse0 (let ((.cse2 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse3 0)))) (store .cse2 c_~A~0.base (store (store (store (store (select .cse2 c_~A~0.base) (+ ~A~0.offset .cse1) 0) (+ ~A~0.offset .cse1 1) 0) (+ 2 ~A~0.offset .cse1) 0) (+ 3 ~A~0.offset .cse1) 0))))) (store .cse0 c_~B~0.base (store (store (store (store (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ 2 .cse1 c_~B~0.offset) 0) (+ 3 .cse1 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_6273) c_~B~0.base) .cse3)) 0)) (not (= c_~C~0.base c_~A~0.base)) (forall ((~A~0.offset Int) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6273 (Array Int Int))) (= (let ((.cse7 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (let ((.cse5 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse4 (let ((.cse6 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ .cse7 c_~B~0.offset 1) 0)))) (store .cse6 c_~A~0.base (store (store (store (store (select .cse6 c_~A~0.base) (+ ~A~0.offset .cse5) 0) (+ ~A~0.offset .cse5 1) 0) (+ 2 ~A~0.offset .cse5) 0) (+ 3 ~A~0.offset .cse5) 0))))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ 2 .cse5 c_~B~0.offset) 0) (+ 3 .cse5 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_6273) c_~B~0.base) (+ .cse7 c_~B~0.offset))) 0)) (<= 2 c_thread1Thread1of1ForFork2_~i~0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base))) is different from false [2022-04-18 20:30:05,530 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#race| c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0) (forall ((~A~0.offset Int) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6273 (Array Int Int))) (= (let ((.cse3 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1))) (select (select (store (let ((.cse1 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse0 (let ((.cse2 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse3 0)))) (store .cse2 c_~A~0.base (store (store (store (store (select .cse2 c_~A~0.base) (+ ~A~0.offset .cse1) 0) (+ ~A~0.offset .cse1 1) 0) (+ 2 ~A~0.offset .cse1) 0) (+ 3 ~A~0.offset .cse1) 0))))) (store .cse0 c_~B~0.base (store (store (store (store (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ 2 .cse1 c_~B~0.offset) 0) (+ 3 .cse1 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_6273) c_~B~0.base) .cse3)) 0)) (not (= 0 (+ c_thread1Thread1of1ForFork2_~i~0 (* (- 1) |c_thread2Thread1of1ForFork0_~i~1#1|)))) (not (= c_~C~0.base c_~A~0.base)) (forall ((~A~0.offset Int) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6273 (Array Int Int))) (= (let ((.cse7 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (let ((.cse5 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse4 (let ((.cse6 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ .cse7 c_~B~0.offset 1) 0)))) (store .cse6 c_~A~0.base (store (store (store (store (select .cse6 c_~A~0.base) (+ ~A~0.offset .cse5) 0) (+ ~A~0.offset .cse5 1) 0) (+ 2 ~A~0.offset .cse5) 0) (+ 3 ~A~0.offset .cse5) 0))))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ 2 .cse5 c_~B~0.offset) 0) (+ 3 .cse5 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_6273) c_~B~0.base) (+ .cse7 c_~B~0.offset))) 0)) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base))) is different from false [2022-04-18 20:30:07,594 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~B~0.base)) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (= (select .cse0 (+ .cse1 c_~B~0.offset)) 0) (not (= 0 (+ c_thread1Thread1of1ForFork2_~i~0 (* (- 1) |c_thread2Thread1of1ForFork0_~i~1#1|)))) (forall ((~A~0.offset Int) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6273 (Array Int Int))) (= (select (select (store (let ((.cse3 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse3) 0) (+ ~A~0.offset .cse3 1) 0) (+ 2 ~A~0.offset .cse3) 0) (+ 3 ~A~0.offset .cse3) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_6273) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0)) (not (= c_~C~0.base c_~A~0.base)) (forall ((~A~0.offset Int) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6273 (Array Int Int))) (= (select (select (store (let ((.cse5 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse5) 0) (+ ~A~0.offset .cse5 1) 0) (+ 2 ~A~0.offset .cse5) 0) (+ 3 ~A~0.offset .cse5) 0)))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ 2 .cse5 c_~B~0.offset) 0) (+ 3 .cse5 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_6273) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (= (select .cse0 (+ .cse1 c_~B~0.offset 1)) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)))) is different from false [2022-04-18 20:30:10,111 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#race| c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0) (forall ((~A~0.offset Int) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6273 (Array Int Int))) (= (let ((.cse3 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1))) (select (select (store (let ((.cse1 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse0 (let ((.cse2 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse3 0)))) (store .cse2 c_~A~0.base (store (store (store (store (select .cse2 c_~A~0.base) (+ ~A~0.offset .cse1) 0) (+ ~A~0.offset .cse1 1) 0) (+ 2 ~A~0.offset .cse1) 0) (+ 3 ~A~0.offset .cse1) 0))))) (store .cse0 c_~B~0.base (store (store (store (store (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ 2 .cse1 c_~B~0.offset) 0) (+ 3 .cse1 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_6273) c_~B~0.base) .cse3)) 0)) (not (= c_~C~0.base c_~A~0.base)) (forall ((~A~0.offset Int) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6273 (Array Int Int))) (= (let ((.cse7 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (let ((.cse5 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse4 (let ((.cse6 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ .cse7 c_~B~0.offset 1) 0)))) (store .cse6 c_~A~0.base (store (store (store (store (select .cse6 c_~A~0.base) (+ ~A~0.offset .cse5) 0) (+ ~A~0.offset .cse5 1) 0) (+ 2 ~A~0.offset .cse5) 0) (+ 3 ~A~0.offset .cse5) 0))))) (store .cse4 c_~B~0.base (store (store (store (store (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ 2 .cse5 c_~B~0.offset) 0) (+ 3 .cse5 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_6273) c_~B~0.base) (+ .cse7 c_~B~0.offset))) 0)) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base))) is different from false [2022-04-18 20:30:10,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:30:10,497 INFO L93 Difference]: Finished difference Result 89550 states and 373506 transitions. [2022-04-18 20:30:10,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-18 20:30:10,497 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 27 states have internal predecessors, (99), 0 states have call successors, (0), 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 46 [2022-04-18 20:30:10,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:30:10,893 INFO L225 Difference]: With dead ends: 89550 [2022-04-18 20:30:10,893 INFO L226 Difference]: Without dead ends: 89550 [2022-04-18 20:30:10,893 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=318, Invalid=1346, Unknown=8, NotChecked=680, Total=2352 [2022-04-18 20:30:10,894 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 499 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 3567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1754 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:30:10,894 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [499 Valid, 720 Invalid, 3567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1713 Invalid, 0 Unknown, 1754 Unchecked, 3.2s Time] [2022-04-18 20:30:10,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89550 states. [2022-04-18 20:30:12,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89550 to 58913. [2022-04-18 20:30:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58913 states, 58910 states have (on average 4.18017314547615) internal successors, (246254), 58912 states have internal predecessors, (246254), 0 states have call successors, (0), 0 states have call 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:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58913 states to 58913 states and 246254 transitions. [2022-04-18 20:30:13,251 INFO L78 Accepts]: Start accepts. Automaton has 58913 states and 246254 transitions. Word has length 46 [2022-04-18 20:30:13,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:30:13,251 INFO L478 AbstractCegarLoop]: Abstraction has 58913 states and 246254 transitions. [2022-04-18 20:30:13,251 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 27 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call 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:13,251 INFO L276 IsEmpty]: Start isEmpty. Operand 58913 states and 246254 transitions. [2022-04-18 20:30:13,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-18 20:30:13,332 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:30:13,333 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 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:30:13,353 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:30:13,533 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,SelfDestructingSolverStorable21 [2022-04-18 20:30:13,533 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:30:13,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:30:13,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1443691523, now seen corresponding path program 6 times [2022-04-18 20:30:13,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:30:13,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771618452] [2022-04-18 20:30:13,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:30:13,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:30:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:30:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-18 20:30:13,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:30:13,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771618452] [2022-04-18 20:30:13,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771618452] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:30:13,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694532958] [2022-04-18 20:30:13,961 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:30:13,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:30:13,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:30:13,964 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:30:13,997 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:30:14,558 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:30:14,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:30:14,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 94 conjunts are in the unsatisfiable core [2022-04-18 20:30:14,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:30:14,616 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:30:14,616 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:30:14,669 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:30:14,669 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-04-18 20:30:14,771 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:30:14,771 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 16 treesize of output 18 [2022-04-18 20:30:15,249 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 15 treesize of output 11 [2022-04-18 20:30:15,305 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-18 20:30:15,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, 2 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:30:15,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 110 [2022-04-18 20:30:15,555 INFO L356 Elim1Store]: treesize reduction 169, result has 11.5 percent of original size [2022-04-18 20:30:15,556 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 321 treesize of output 149 [2022-04-18 20:30:16,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:30:16,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:30:16,067 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 61 treesize of output 56 [2022-04-18 20:30:16,185 INFO L356 Elim1Store]: treesize reduction 936, result has 6.0 percent of original size [2022-04-18 20:30:16,186 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 7 case distinctions, treesize of input 53 treesize of output 78 [2022-04-18 20:30:16,350 INFO L356 Elim1Store]: treesize reduction 548, result has 11.6 percent of original size [2022-04-18 20:30:16,350 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 88 treesize of output 105 [2022-04-18 20:30:16,415 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-18 20:30:16,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:30:16,481 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~A~0.offset Int) (v_ArrVal_6782 (Array Int Int)) (v_ArrVal_6770 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_6782) c_~B~0.base (let ((.cse0 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse0 ~A~0.offset) 0) (+ .cse0 ~A~0.offset 1) 0) (+ .cse0 2 ~A~0.offset) 0) (+ .cse0 3 ~A~0.offset) 0)) c_~B~0.base) (+ .cse0 c_~B~0.offset) 0) (+ .cse0 c_~B~0.offset 1) 0) (+ .cse0 2 c_~B~0.offset) 0) (+ .cse0 3 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_6770) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_6782 (Array Int Int)) (v_ArrVal_6770 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_6782) c_~B~0.base (let ((.cse1 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse1 ~A~0.offset) 0) (+ .cse1 ~A~0.offset 1) 0) (+ .cse1 2 ~A~0.offset) 0) (+ .cse1 3 ~A~0.offset) 0)) c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ .cse1 2 c_~B~0.offset) 0) (+ .cse1 3 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_6770) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0))) is different from false [2022-04-18 20:30:16,537 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~A~0.offset Int) (v_ArrVal_6782 (Array Int Int)) (v_ArrVal_6770 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_6782) c_~B~0.base (store (store (store (store (select (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset 4) 0) (+ 5 ~A~0.offset) 0) (+ 6 ~A~0.offset) 0) (+ 7 ~A~0.offset) 0)) c_~B~0.base) (+ 4 c_~B~0.offset) 0) (+ 5 c_~B~0.offset) 0) (+ 6 c_~B~0.offset) 0) (+ 7 c_~B~0.offset) 0)) c_~C~0.base v_ArrVal_6770) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_6782 (Array Int Int)) (v_ArrVal_6770 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_6782) c_~B~0.base (store (store (store (store (select (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset 4) 0) (+ 5 ~A~0.offset) 0) (+ 6 ~A~0.offset) 0) (+ 7 ~A~0.offset) 0)) c_~B~0.base) (+ 4 c_~B~0.offset) 0) (+ 5 c_~B~0.offset) 0) (+ 6 c_~B~0.offset) 0) (+ 7 c_~B~0.offset) 0)) c_~C~0.base v_ArrVal_6770) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0))) is different from false [2022-04-18 20:30:16,603 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~A~0.offset Int) (v_ArrVal_6782 (Array Int Int)) (v_ArrVal_6770 (Array Int Int))) (= (let ((.cse1 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1))) (select (select (store (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse1 0)))) (store (store .cse0 c_~A~0.base v_ArrVal_6782) c_~B~0.base (store (store (store (store (select (store .cse0 c_~A~0.base (store (store (store (store (select .cse0 c_~A~0.base) (+ ~A~0.offset 4) 0) (+ 5 ~A~0.offset) 0) (+ 6 ~A~0.offset) 0) (+ 7 ~A~0.offset) 0)) c_~B~0.base) (+ 4 c_~B~0.offset) 0) (+ 5 c_~B~0.offset) 0) (+ 6 c_~B~0.offset) 0) (+ 7 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_6770) c_~B~0.base) .cse1)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_6782 (Array Int Int)) (v_ArrVal_6770 (Array Int Int))) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (let ((.cse2 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ .cse3 c_~B~0.offset 1) 0)))) (store (store .cse2 c_~A~0.base v_ArrVal_6782) c_~B~0.base (store (store (store (store (select (store .cse2 c_~A~0.base (store (store (store (store (select .cse2 c_~A~0.base) (+ ~A~0.offset 4) 0) (+ 5 ~A~0.offset) 0) (+ 6 ~A~0.offset) 0) (+ 7 ~A~0.offset) 0)) c_~B~0.base) (+ 4 c_~B~0.offset) 0) (+ 5 c_~B~0.offset) 0) (+ 6 c_~B~0.offset) 0) (+ 7 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_6770) c_~B~0.base) (+ .cse3 c_~B~0.offset))) 0))) is different from false [2022-04-18 20:30:16,791 INFO L356 Elim1Store]: treesize reduction 848, result has 9.7 percent of original size [2022-04-18 20:30:16,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 128 treesize of output 148 [2022-04-18 20:30:16,802 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-18 20:30:16,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 73 [2022-04-18 20:30:16,812 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:30:16,812 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 103 treesize of output 97 [2022-04-18 20:30:16,818 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 14 treesize of output 7 [2022-04-18 20:30:16,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:30:16,824 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 0 case distinctions, treesize of input 22 treesize of output 9 [2022-04-18 20:30:16,850 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-04-18 20:30:16,850 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 123 treesize of output 1 [2022-04-18 20:30:16,868 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-04-18 20:30:16,869 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 22 treesize of output 9 [2022-04-18 20:30:16,987 INFO L356 Elim1Store]: treesize reduction 93, result has 54.9 percent of original size [2022-04-18 20:30:16,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 59 treesize of output 142 [2022-04-18 20:30:17,124 INFO L356 Elim1Store]: treesize reduction 938, result has 0.1 percent of original size [2022-04-18 20:30:17,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 127 treesize of output 1 [2022-04-18 20:30:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 1 not checked. [2022-04-18 20:30:17,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694532958] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:30:17,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1888695344] [2022-04-18 20:30:17,231 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:30:17,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:30:17,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 10] total 32 [2022-04-18 20:30:17,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026387419] [2022-04-18 20:30:17,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:30:17,235 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-18 20:30:17,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:30:17,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-18 20:30:17,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=732, Unknown=8, NotChecked=174, Total=1056 [2022-04-18 20:30:17,239 INFO L87 Difference]: Start difference. First operand 58913 states and 246254 transitions. Second operand has 33 states, 32 states have (on average 3.46875) internal successors, (111), 33 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:29,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:30:29,442 INFO L93 Difference]: Finished difference Result 83573 states and 351817 transitions. [2022-04-18 20:30:29,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-18 20:30:29,442 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.46875) internal successors, (111), 33 states have internal predecessors, (111), 0 states have call successors, (0), 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 46 [2022-04-18 20:30:29,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:30:30,005 INFO L225 Difference]: With dead ends: 83573 [2022-04-18 20:30:30,005 INFO L226 Difference]: Without dead ends: 82989 [2022-04-18 20:30:30,006 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=519, Invalid=2125, Unknown=20, NotChecked=306, Total=2970 [2022-04-18 20:30:30,006 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 722 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 2188 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 3678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 2188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1291 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-18 20:30:30,007 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [722 Valid, 563 Invalid, 3678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 2188 Invalid, 0 Unknown, 1291 Unchecked, 4.7s Time] [2022-04-18 20:30:30,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82989 states. [2022-04-18 20:30:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82989 to 66834. [2022-04-18 20:30:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66834 states, 66832 states have (on average 4.1776843428297825) internal successors, (279203), 66833 states have internal predecessors, (279203), 0 states have call successors, (0), 0 states have call 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:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66834 states to 66834 states and 279203 transitions. [2022-04-18 20:30:32,211 INFO L78 Accepts]: Start accepts. Automaton has 66834 states and 279203 transitions. Word has length 46 [2022-04-18 20:30:32,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:30:32,211 INFO L478 AbstractCegarLoop]: Abstraction has 66834 states and 279203 transitions. [2022-04-18 20:30:32,212 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.46875) internal successors, (111), 33 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:32,212 INFO L276 IsEmpty]: Start isEmpty. Operand 66834 states and 279203 transitions. [2022-04-18 20:30:32,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-18 20:30:32,272 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:30:32,272 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, 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:30:32,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-18 20:30:32,472 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,SelfDestructingSolverStorable22 [2022-04-18 20:30:32,472 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:30:32,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:30:32,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1252491524, now seen corresponding path program 1 times [2022-04-18 20:30:32,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:30:32,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677579384] [2022-04-18 20:30:32,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:30:32,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:30:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:30:33,055 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-18 20:30:33,055 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:30:33,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677579384] [2022-04-18 20:30:33,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677579384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:30:33,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:30:33,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-18 20:30:33,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609515665] [2022-04-18 20:30:33,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:30:33,056 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-18 20:30:33,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:30:33,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-18 20:30:33,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:30:33,057 INFO L87 Difference]: Start difference. First operand 66834 states and 279203 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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:34,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:30:34,496 INFO L93 Difference]: Finished difference Result 66819 states and 279155 transitions. [2022-04-18 20:30:34,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-18 20:30:34,497 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 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 47 [2022-04-18 20:30:34,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:30:34,740 INFO L225 Difference]: With dead ends: 66819 [2022-04-18 20:30:34,740 INFO L226 Difference]: Without dead ends: 63385 [2022-04-18 20:30:34,740 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-04-18 20:30:34,741 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 172 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-18 20:30:34,741 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 57 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-18 20:30:34,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63385 states. [2022-04-18 20:30:36,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63385 to 63385. [2022-04-18 20:30:36,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63385 states, 63384 states have (on average 4.160986999873785) internal successors, (263740), 63384 states have internal predecessors, (263740), 0 states have call successors, (0), 0 states have call 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:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63385 states to 63385 states and 263740 transitions. [2022-04-18 20:30:36,662 INFO L78 Accepts]: Start accepts. Automaton has 63385 states and 263740 transitions. Word has length 47 [2022-04-18 20:30:36,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:30:36,662 INFO L478 AbstractCegarLoop]: Abstraction has 63385 states and 263740 transitions. [2022-04-18 20:30:36,662 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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:36,662 INFO L276 IsEmpty]: Start isEmpty. Operand 63385 states and 263740 transitions. [2022-04-18 20:30:36,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-18 20:30:36,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:30:36,718 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:30:36,718 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-18 20:30:36,718 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:30:36,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:30:36,718 INFO L85 PathProgramCache]: Analyzing trace with hash 391018564, now seen corresponding path program 1 times [2022-04-18 20:30:36,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:30:36,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759206092] [2022-04-18 20:30:36,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:30:36,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:30:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:30:37,491 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-18 20:30:37,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:30:37,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759206092] [2022-04-18 20:30:37,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759206092] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:30:37,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787461554] [2022-04-18 20:30:37,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:30:37,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:30:37,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:30:37,493 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:30:37,494 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:30:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:30:37,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 83 conjunts are in the unsatisfiable core [2022-04-18 20:30:37,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:30:38,006 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:30:38,006 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:30:38,057 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:30:38,057 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-04-18 20:30:38,120 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:30:38,121 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 16 treesize of output 18 [2022-04-18 20:30:38,558 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 15 treesize of output 11 [2022-04-18 20:30:38,619 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-18 20:30:38,619 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 28 treesize of output 27 [2022-04-18 20:30:38,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 127 [2022-04-18 20:30:38,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 90 [2022-04-18 20:30:38,779 INFO L356 Elim1Store]: treesize reduction 756, result has 7.2 percent of original size [2022-04-18 20:30:38,779 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 6 case distinctions, treesize of input 56 treesize of output 77 [2022-04-18 20:30:42,953 INFO L356 Elim1Store]: treesize reduction 500, result has 12.4 percent of original size [2022-04-18 20:30:42,953 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:30:45,125 INFO L356 Elim1Store]: treesize reduction 647, result has 11.4 percent of original size [2022-04-18 20:30:45,126 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:30:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-18 20:30:47,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:30:47,268 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~A~0.offset Int) (v_ArrVal_7482 (Array Int Int)) (v_ArrVal_7494 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_7494) c_~B~0.base (let ((.cse0 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse0 ~A~0.offset) 0) (+ .cse0 ~A~0.offset 1) 0) (+ .cse0 2 ~A~0.offset) 0) (+ .cse0 3 ~A~0.offset) 0)) c_~B~0.base) (+ .cse0 c_~B~0.offset) 0) (+ .cse0 c_~B~0.offset 1) 0) (+ .cse0 2 c_~B~0.offset) 0) (+ .cse0 3 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_7482) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_7482 (Array Int Int)) (v_ArrVal_7494 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_7494) c_~B~0.base (let ((.cse1 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse1 ~A~0.offset) 0) (+ .cse1 ~A~0.offset 1) 0) (+ .cse1 2 ~A~0.offset) 0) (+ .cse1 3 ~A~0.offset) 0)) c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ .cse1 2 c_~B~0.offset) 0) (+ .cse1 3 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_7482) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0))) is different from false [2022-04-18 20:30:47,362 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~A~0.offset Int) (v_ArrVal_7482 (Array Int Int)) (v_ArrVal_7494 (Array Int Int))) (= (let ((.cse2 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1))) (select (select (store (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse2 0)))) (store (store .cse0 c_~A~0.base v_ArrVal_7494) c_~B~0.base (let ((.cse1 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store .cse0 c_~A~0.base (store (store (store (store (select .cse0 c_~A~0.base) (+ .cse1 ~A~0.offset) 0) (+ .cse1 ~A~0.offset 1) 0) (+ .cse1 2 ~A~0.offset) 0) (+ .cse1 3 ~A~0.offset) 0)) c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ .cse1 2 c_~B~0.offset) 0) (+ .cse1 3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_7482) c_~B~0.base) .cse2)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_7482 (Array Int Int)) (v_ArrVal_7494 (Array Int Int))) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (let ((.cse3 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ .cse5 c_~B~0.offset 1) 0)))) (store (store .cse3 c_~A~0.base v_ArrVal_7494) c_~B~0.base (let ((.cse4 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store .cse3 c_~A~0.base (store (store (store (store (select .cse3 c_~A~0.base) (+ .cse4 ~A~0.offset) 0) (+ .cse4 ~A~0.offset 1) 0) (+ .cse4 2 ~A~0.offset) 0) (+ .cse4 3 ~A~0.offset) 0)) c_~B~0.base) (+ .cse4 c_~B~0.offset) 0) (+ .cse4 c_~B~0.offset 1) 0) (+ .cse4 2 c_~B~0.offset) 0) (+ .cse4 3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_7482) c_~B~0.base) (+ .cse5 c_~B~0.offset))) 0))) is different from false [2022-04-18 20:30:47,577 INFO L356 Elim1Store]: treesize reduction 1041, result has 8.9 percent of original size [2022-04-18 20:30:47,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 149 treesize of output 174 [2022-04-18 20:30:47,595 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-04-18 20:30:47,596 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 149 treesize of output 124 [2022-04-18 20:30:47,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:30:47,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 67 [2022-04-18 20:30:47,608 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 13 treesize of output 7 [2022-04-18 20:30:47,665 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-04-18 20:30:47,665 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 22 treesize of output 9 [2022-04-18 20:30:47,772 INFO L356 Elim1Store]: treesize reduction 126, result has 51.7 percent of original size [2022-04-18 20:30:47,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 70 treesize of output 164 [2022-04-18 20:30:47,911 INFO L356 Elim1Store]: treesize reduction 1142, result has 0.1 percent of original size [2022-04-18 20:30:47,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 150 treesize of output 1 [2022-04-18 20:30:48,033 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 1 not checked. [2022-04-18 20:30:48,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787461554] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:30:48,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [967957978] [2022-04-18 20:30:48,034 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:30:48,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:30:48,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 29 [2022-04-18 20:30:48,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327373344] [2022-04-18 20:30:48,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:30:48,035 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-18 20:30:48,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:30:48,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-18 20:30:48,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=633, Unknown=3, NotChecked=106, Total=870 [2022-04-18 20:30:48,036 INFO L87 Difference]: Start difference. First operand 63385 states and 263740 transitions. Second operand has 30 states, 29 states have (on average 3.8620689655172415) internal successors, (112), 30 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:09,372 INFO L93 Difference]: Finished difference Result 117180 states and 489754 transitions. [2022-04-18 20:31:09,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-18 20:31:09,373 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.8620689655172415) internal successors, (112), 30 states have internal predecessors, (112), 0 states have call successors, (0), 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 47 [2022-04-18 20:31:09,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:10,238 INFO L225 Difference]: With dead ends: 117180 [2022-04-18 20:31:10,238 INFO L226 Difference]: Without dead ends: 117180 [2022-04-18 20:31:10,239 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 85 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=558, Invalid=2416, Unknown=4, NotChecked=214, Total=3192 [2022-04-18 20:31:10,239 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 862 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 1712 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 3557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1575 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:10,240 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [862 Valid, 486 Invalid, 3557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1712 Invalid, 0 Unknown, 1575 Unchecked, 3.6s Time] [2022-04-18 20:31:10,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117180 states. [2022-04-18 20:31:12,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117180 to 80438. [2022-04-18 20:31:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80438 states, 80437 states have (on average 4.175553538794336) internal successors, (335869), 80437 states have internal predecessors, (335869), 0 states have call successors, (0), 0 states have call 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,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80438 states to 80438 states and 335869 transitions. [2022-04-18 20:31:13,556 INFO L78 Accepts]: Start accepts. Automaton has 80438 states and 335869 transitions. Word has length 47 [2022-04-18 20:31:13,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:13,556 INFO L478 AbstractCegarLoop]: Abstraction has 80438 states and 335869 transitions. [2022-04-18 20:31:13,557 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.8620689655172415) internal successors, (112), 30 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,557 INFO L276 IsEmpty]: Start isEmpty. Operand 80438 states and 335869 transitions. [2022-04-18 20:31:13,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-18 20:31:13,637 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:13,638 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:13,655 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:31:13,838 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,SelfDestructingSolverStorable24 [2022-04-18 20:31:13,838 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:31:13,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:13,839 INFO L85 PathProgramCache]: Analyzing trace with hash 552964348, now seen corresponding path program 2 times [2022-04-18 20:31:13,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:31:13,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082693654] [2022-04-18 20:31:13,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:31:13,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:31:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:31:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-18 20:31:14,305 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:31:14,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082693654] [2022-04-18 20:31:14,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082693654] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:31:14,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121297569] [2022-04-18 20:31:14,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:31:14,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:31:14,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:31:14,307 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:31:14,307 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:31:14,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:31:14,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:14,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-18 20:31:14,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:14,755 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:31:14,755 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:31:14,797 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:14,799 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-04-18 20:31:14,871 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:31:14,872 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 16 treesize of output 18 [2022-04-18 20:31:15,132 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 15 treesize of output 11 [2022-04-18 20:31:15,186 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-18 20:31:15,186 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 28 treesize of output 27 [2022-04-18 20:31:15,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 132 [2022-04-18 20:31:15,366 INFO L356 Elim1Store]: treesize reduction 283, result has 11.3 percent of original size [2022-04-18 20:31:15,367 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 36 treesize of output 48 [2022-04-18 20:31:15,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:15,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:15,927 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 72 treesize of output 67 [2022-04-18 20:31:16,050 INFO L356 Elim1Store]: treesize reduction 1166, result has 5.7 percent of original size [2022-04-18 20:31:16,050 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 7 case distinctions, treesize of input 64 treesize of output 89 [2022-04-18 20:31:16,057 INFO L356 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-04-18 20:31:16,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 13 [2022-04-18 20:31:18,613 INFO L356 Elim1Store]: treesize reduction 647, result has 11.4 percent of original size [2022-04-18 20:31:18,613 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:31:18,672 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-18 20:31:18,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:31:18,781 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~A~0.offset Int) (v_ArrVal_7983 (Array Int Int)) (v_ArrVal_7995 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_7995) c_~B~0.base (let ((.cse0 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse0) 0) (+ ~A~0.offset .cse0 1) 0) (+ 2 ~A~0.offset .cse0) 0) (+ 3 ~A~0.offset .cse0) 0)) c_~B~0.base) (+ .cse0 c_~B~0.offset) 0) (+ .cse0 c_~B~0.offset 1) 0) (+ 2 .cse0 c_~B~0.offset) 0) (+ 3 .cse0 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_7983) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_7983 (Array Int Int)) (v_ArrVal_7995 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_7995) c_~B~0.base (let ((.cse1 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse1) 0) (+ ~A~0.offset .cse1 1) 0) (+ 2 ~A~0.offset .cse1) 0) (+ 3 ~A~0.offset .cse1) 0)) c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ 2 .cse1 c_~B~0.offset) 0) (+ 3 .cse1 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_7983) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0))) is different from false [2022-04-18 20:31:18,889 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~A~0.offset Int) (v_ArrVal_7983 (Array Int Int)) (v_ArrVal_7995 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= 0 (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ .cse2 c_~B~0.offset 1) 0)))) (store (store .cse0 c_~A~0.base v_ArrVal_7995) c_~B~0.base (let ((.cse1 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store .cse0 c_~A~0.base (store (store (store (store (select .cse0 c_~A~0.base) (+ ~A~0.offset .cse1) 0) (+ ~A~0.offset .cse1 1) 0) (+ 2 ~A~0.offset .cse1) 0) (+ 3 ~A~0.offset .cse1) 0)) c_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ 2 .cse1 c_~B~0.offset) 0) (+ 3 .cse1 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_7983) c_~B~0.base) (+ .cse2 c_~B~0.offset))))) (forall ((~A~0.offset Int) (v_ArrVal_7983 (Array Int Int)) (v_ArrVal_7995 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (let ((.cse5 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1))) (select (select (store (let ((.cse3 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse5 0)))) (store (store .cse3 c_~A~0.base v_ArrVal_7995) c_~B~0.base (let ((.cse4 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store .cse3 c_~A~0.base (store (store (store (store (select .cse3 c_~A~0.base) (+ ~A~0.offset .cse4) 0) (+ ~A~0.offset .cse4 1) 0) (+ 2 ~A~0.offset .cse4) 0) (+ 3 ~A~0.offset .cse4) 0)) c_~B~0.base) (+ .cse4 c_~B~0.offset) 0) (+ .cse4 c_~B~0.offset 1) 0) (+ 2 .cse4 c_~B~0.offset) 0) (+ 3 .cse4 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_7983) c_~B~0.base) .cse5)) 0))) is different from false [2022-04-18 20:31:19,136 INFO L356 Elim1Store]: treesize reduction 1041, result has 8.9 percent of original size [2022-04-18 20:31:19,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 150 treesize of output 175 [2022-04-18 20:31:19,155 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-04-18 20:31:19,155 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 150 treesize of output 125 [2022-04-18 20:31:19,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:31:19,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 69 [2022-04-18 20:31:19,169 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 14 treesize of output 7 [2022-04-18 20:31:19,317 INFO L356 Elim1Store]: treesize reduction 126, result has 51.7 percent of original size [2022-04-18 20:31:19,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 70 treesize of output 164 [2022-04-18 20:31:19,438 INFO L356 Elim1Store]: treesize reduction 1142, result has 0.1 percent of original size [2022-04-18 20:31:19,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 149 treesize of output 1 [2022-04-18 20:31:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 1 not checked. [2022-04-18 20:31:19,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121297569] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:31:19,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [103002723] [2022-04-18 20:31:19,564 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:31:19,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:31:19,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2022-04-18 20:31:19,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223245494] [2022-04-18 20:31:19,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:31:19,565 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-18 20:31:19,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:31:19,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-18 20:31:19,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=459, Unknown=11, NotChecked=90, Total=650 [2022-04-18 20:31:19,566 INFO L87 Difference]: Start difference. First operand 80438 states and 335869 transitions. Second operand has 26 states, 25 states have (on average 4.04) internal successors, (101), 26 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:31:22,387 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~B~0.base)) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (= (select .cse0 (+ .cse1 c_~B~0.offset)) 0) (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((~A~0.offset Int) (v_ArrVal_7983 (Array Int Int)) (v_ArrVal_7995 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_7995) c_~B~0.base (let ((.cse2 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse2) 0) (+ ~A~0.offset .cse2 1) 0) (+ 2 ~A~0.offset .cse2) 0) (+ 3 ~A~0.offset .cse2) 0)) c_~B~0.base) (+ .cse2 c_~B~0.offset) 0) (+ .cse2 c_~B~0.offset 1) 0) (+ 2 .cse2 c_~B~0.offset) 0) (+ 3 .cse2 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_7983) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_7983 (Array Int Int)) (v_ArrVal_7995 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_7995) c_~B~0.base (let ((.cse3 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse3) 0) (+ ~A~0.offset .cse3 1) 0) (+ 2 ~A~0.offset .cse3) 0) (+ 3 ~A~0.offset .cse3) 0)) c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_7983) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= (+ (- 1) c_thread1Thread1of1ForFork2_~i~0) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select .cse0 (+ .cse1 c_~B~0.offset 1)) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (= (select |c_#valid| c_~A~0.base) 1))) is different from false [2022-04-18 20:31:33,649 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~B~0.base)) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (= (select .cse0 (+ .cse1 c_~B~0.offset)) 0) (forall ((~A~0.offset Int) (v_ArrVal_7983 (Array Int Int)) (v_ArrVal_7995 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_7995) c_~B~0.base (let ((.cse2 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse2) 0) (+ ~A~0.offset .cse2 1) 0) (+ 2 ~A~0.offset .cse2) 0) (+ 3 ~A~0.offset .cse2) 0)) c_~B~0.base) (+ .cse2 c_~B~0.offset) 0) (+ .cse2 c_~B~0.offset 1) 0) (+ 2 .cse2 c_~B~0.offset) 0) (+ 3 .cse2 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_7983) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_7983 (Array Int Int)) (v_ArrVal_7995 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_7995) c_~B~0.base (let ((.cse3 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse3) 0) (+ ~A~0.offset .cse3 1) 0) (+ 2 ~A~0.offset .cse3) 0) (+ 3 ~A~0.offset .cse3) 0)) c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_7983) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (not (= c_~C~0.base c_~A~0.base)) (<= 2 c_thread1Thread1of1ForFork2_~i~0) (= (select .cse0 (+ .cse1 c_~B~0.offset 1)) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)))) is different from false [2022-04-18 20:31:37,046 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (select |c_#race| c_~B~0.base)) (.cse4 (+ .cse1 c_~B~0.offset 1))) (and (= (select .cse0 (+ .cse1 c_~B~0.offset)) 0) (forall ((~A~0.offset Int) (v_ArrVal_7983 (Array Int Int)) (v_ArrVal_7995 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_7995) c_~B~0.base (let ((.cse2 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse2) 0) (+ ~A~0.offset .cse2 1) 0) (+ 2 ~A~0.offset .cse2) 0) (+ 3 ~A~0.offset .cse2) 0)) c_~B~0.base) (+ .cse2 c_~B~0.offset) 0) (+ .cse2 c_~B~0.offset 1) 0) (+ 2 .cse2 c_~B~0.offset) 0) (+ 3 .cse2 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_7983) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_7983 (Array Int Int)) (v_ArrVal_7995 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_7995) c_~B~0.base (let ((.cse3 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse3) 0) (+ ~A~0.offset .cse3 1) 0) (+ 2 ~A~0.offset .cse3) 0) (+ 3 ~A~0.offset .cse3) 0)) c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_7983) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (not (= c_~C~0.base c_~A~0.base)) (<= 2 c_thread1Thread1of1ForFork2_~i~0) (= (select .cse0 .cse4) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (not (= (+ (* |c_thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset 1) .cse4))))) is different from false [2022-04-18 20:31:39,079 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~B~0.base)) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (= (select .cse0 (+ .cse1 c_~B~0.offset)) 0) (forall ((~A~0.offset Int) (v_ArrVal_7983 (Array Int Int)) (v_ArrVal_7995 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_7995) c_~B~0.base (let ((.cse2 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse2) 0) (+ ~A~0.offset .cse2 1) 0) (+ 2 ~A~0.offset .cse2) 0) (+ 3 ~A~0.offset .cse2) 0)) c_~B~0.base) (+ .cse2 c_~B~0.offset) 0) (+ .cse2 c_~B~0.offset 1) 0) (+ 2 .cse2 c_~B~0.offset) 0) (+ 3 .cse2 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_7983) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_7983 (Array Int Int)) (v_ArrVal_7995 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_7995) c_~B~0.base (let ((.cse3 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ ~A~0.offset .cse3) 0) (+ ~A~0.offset .cse3 1) 0) (+ 2 ~A~0.offset .cse3) 0) (+ 3 ~A~0.offset .cse3) 0)) c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_7983) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 (+ .cse1 c_~B~0.offset 1)) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)))) is different from false [2022-04-18 20:31:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:46,591 INFO L93 Difference]: Finished difference Result 171403 states and 719893 transitions. [2022-04-18 20:31:46,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-18 20:31:46,595 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.04) internal successors, (101), 26 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 47 [2022-04-18 20:31:46,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:47,526 INFO L225 Difference]: With dead ends: 171403 [2022-04-18 20:31:47,526 INFO L226 Difference]: Without dead ends: 171182 [2022-04-18 20:31:47,527 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=438, Invalid=1971, Unknown=65, NotChecked=606, Total=3080 [2022-04-18 20:31:47,527 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 720 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 3644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1407 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:47,527 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [720 Valid, 655 Invalid, 3644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 2011 Invalid, 0 Unknown, 1407 Unchecked, 4.2s Time] [2022-04-18 20:31:47,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171182 states. [2022-04-18 20:31:51,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171182 to 137267. [2022-04-18 20:31:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137267 states, 137266 states have (on average 4.202074803665875) internal successors, (576802), 137266 states have internal predecessors, (576802), 0 states have call successors, (0), 0 states have call 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:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137267 states to 137267 states and 576802 transitions. [2022-04-18 20:31:52,784 INFO L78 Accepts]: Start accepts. Automaton has 137267 states and 576802 transitions. Word has length 47 [2022-04-18 20:31:52,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:52,784 INFO L478 AbstractCegarLoop]: Abstraction has 137267 states and 576802 transitions. [2022-04-18 20:31:52,784 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.04) internal successors, (101), 26 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:31:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 137267 states and 576802 transitions. [2022-04-18 20:31:53,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-18 20:31:53,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:53,256 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:53,274 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:31:53,457 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,SelfDestructingSolverStorable25 [2022-04-18 20:31:53,457 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:31:53,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:53,457 INFO L85 PathProgramCache]: Analyzing trace with hash -674099656, now seen corresponding path program 3 times [2022-04-18 20:31:53,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:31:53,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536339854] [2022-04-18 20:31:53,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:31:53,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:31:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:31:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-18 20:31:53,798 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:31:53,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536339854] [2022-04-18 20:31:53,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536339854] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:31:53,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646117880] [2022-04-18 20:31:53,798 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:31:53,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:31:53,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:31:53,806 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:31:53,807 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:31:54,418 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:31:54,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:54,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 100 conjunts are in the unsatisfiable core [2022-04-18 20:31:54,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:54,476 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:31:54,476 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:31:54,541 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:54,542 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-04-18 20:31:54,682 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:31:54,682 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 16 treesize of output 18 [2022-04-18 20:31:55,277 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 15 treesize of output 11 [2022-04-18 20:31:55,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,361 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 28 treesize of output 27 [2022-04-18 20:31:55,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 97 [2022-04-18 20:31:55,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 60 [2022-04-18 20:31:55,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 66 [2022-04-18 20:31:55,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,564 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:31:55,564 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 76 treesize of output 90 [2022-04-18 20:31:55,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:55,663 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:31:55,663 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 88 treesize of output 105 [2022-04-18 20:31:55,731 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-18 20:31:55,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:31:55,814 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8481 (Array Int Int)) (v_ArrVal_8494 (Array Int Int))) (= 0 (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_8481) c_~B~0.base (let ((.cse0 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base (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_~B~0.base) (+ .cse0 c_~B~0.offset) 0) (+ .cse0 c_~B~0.offset 1) 0) (+ .cse0 2 c_~B~0.offset) 0) (+ .cse0 3 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_8494) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)))) (forall ((v_ArrVal_8481 (Array Int Int)) (v_ArrVal_8494 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_8481) c_~B~0.base (let ((.cse1 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base (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_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ .cse1 2 c_~B~0.offset) 0) (+ .cse1 3 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_8494) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0))) is different from false [2022-04-18 20:31:55,890 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8481 (Array Int Int)) (v_ArrVal_8494 (Array Int Int))) (= (let ((.cse2 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1))) (select (select (store (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse2 0)))) (store (store .cse0 c_~A~0.base v_ArrVal_8481) c_~B~0.base (let ((.cse1 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store .cse0 c_~A~0.base (store (store (store (store (select .cse0 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_~B~0.base) (+ .cse1 c_~B~0.offset) 0) (+ .cse1 c_~B~0.offset 1) 0) (+ .cse1 2 c_~B~0.offset) 0) (+ .cse1 3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_8494) c_~B~0.base) .cse2)) 0)) (forall ((v_ArrVal_8481 (Array Int Int)) (v_ArrVal_8494 (Array Int Int))) (= (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (let ((.cse3 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ .cse5 c_~B~0.offset 1) 0)))) (store (store .cse3 c_~A~0.base v_ArrVal_8481) c_~B~0.base (let ((.cse4 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store .cse3 c_~A~0.base (store (store (store (store (select .cse3 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_~B~0.base) (+ .cse4 c_~B~0.offset) 0) (+ .cse4 c_~B~0.offset 1) 0) (+ .cse4 2 c_~B~0.offset) 0) (+ .cse4 3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_8494) c_~B~0.base) (+ .cse5 c_~B~0.offset))) 0))) is different from false [2022-04-18 20:31:56,138 INFO L356 Elim1Store]: treesize reduction 1041, result has 8.9 percent of original size [2022-04-18 20:31:56,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 149 treesize of output 169 [2022-04-18 20:31:56,160 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-04-18 20:31:56,160 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 228 treesize of output 211 [2022-04-18 20:31:56,168 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 128 treesize of output 116 [2022-04-18 20:31:56,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:31:56,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:31:56,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:31:56,192 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:31:56,192 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 0 case distinctions, treesize of input 102 treesize of output 83 [2022-04-18 20:31:56,368 INFO L356 Elim1Store]: treesize reduction 126, result has 51.7 percent of original size [2022-04-18 20:31:56,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 79 treesize of output 173 [2022-04-18 20:31:56,617 INFO L356 Elim1Store]: treesize reduction 1142, result has 0.1 percent of original size [2022-04-18 20:31:56,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 150 treesize of output 1 [2022-04-18 20:31:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 1 not checked. [2022-04-18 20:31:56,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646117880] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:31:56,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2034360972] [2022-04-18 20:31:56,756 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:31:56,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:31:56,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 9] total 32 [2022-04-18 20:31:56,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999637175] [2022-04-18 20:31:56,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:31:56,757 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-18 20:31:56,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:31:56,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-18 20:31:56,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=789, Unknown=2, NotChecked=118, Total=1056 [2022-04-18 20:31:56,758 INFO L87 Difference]: Start difference. First operand 137267 states and 576802 transitions. Second operand has 33 states, 32 states have (on average 3.53125) internal successors, (113), 33 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:06,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:32:06,099 INFO L93 Difference]: Finished difference Result 212166 states and 890154 transitions. [2022-04-18 20:32:06,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-18 20:32:06,100 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.53125) internal successors, (113), 33 states have internal predecessors, (113), 0 states have call successors, (0), 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 47 [2022-04-18 20:32:06,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:32:07,699 INFO L225 Difference]: With dead ends: 212166 [2022-04-18 20:32:07,699 INFO L226 Difference]: Without dead ends: 211769 [2022-04-18 20:32:07,700 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=355, Invalid=2000, Unknown=5, NotChecked=190, Total=2550 [2022-04-18 20:32:07,700 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 616 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 3484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 938 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-18 20:32:07,700 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [616 Valid, 832 Invalid, 3484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2445 Invalid, 0 Unknown, 938 Unchecked, 5.5s Time] [2022-04-18 20:32:07,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211769 states.