./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-min.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-min.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 3e185f9c0dac86cdbb29caae2de39811a090d813c08c4c3552062c2aa77b8788 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 20:22:35,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 20:22:35,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 20:22:35,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 20:22:35,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 20:22:35,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 20:22:35,858 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 20:22:35,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 20:22:35,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 20:22:35,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 20:22:35,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 20:22:35,876 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 20:22:35,877 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 20:22:35,878 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 20:22:35,879 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 20:22:35,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 20:22:35,881 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 20:22:35,882 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 20:22:35,884 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 20:22:35,888 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 20:22:35,889 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 20:22:35,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 20:22:35,890 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 20:22:35,891 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 20:22:35,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 20:22:35,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 20:22:35,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 20:22:35,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 20:22:35,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 20:22:35,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 20:22:35,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 20:22:35,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 20:22:35,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 20:22:35,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 20:22:35,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 20:22:35,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 20:22:35,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 20:22:35,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 20:22:35,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 20:22:35,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 20:22:35,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 20:22:35,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 20:22:35,905 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:35,929 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 20:22:35,929 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 20:22:35,929 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 20:22:35,929 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 20:22:35,930 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 20:22:35,930 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 20:22:35,930 INFO L138 SettingsManager]: * User list type=DISABLED [2022-04-18 20:22:35,930 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-04-18 20:22:35,930 INFO L138 SettingsManager]: * Explicit value domain=true [2022-04-18 20:22:35,931 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-04-18 20:22:35,931 INFO L138 SettingsManager]: * Octagon Domain=false [2022-04-18 20:22:35,931 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-04-18 20:22:35,931 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-04-18 20:22:35,932 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-04-18 20:22:35,932 INFO L138 SettingsManager]: * Interval Domain=false [2022-04-18 20:22:35,932 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-04-18 20:22:35,932 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-04-18 20:22:35,932 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-04-18 20:22:35,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 20:22:35,933 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 20:22:35,933 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 20:22:35,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 20:22:35,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 20:22:35,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 20:22:35,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 20:22:35,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 20:22:35,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 20:22:35,934 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 20:22:35,935 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 20:22:35,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 20:22:35,935 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 20:22:35,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 20:22:35,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 20:22:35,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 20:22:35,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 20:22:35,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 20:22:35,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 20:22:35,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 20:22:35,937 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-04-18 20:22:35,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 20:22:35,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 20:22:35,937 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-18 20:22:35,937 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-18 20:22:35,937 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 -> 3e185f9c0dac86cdbb29caae2de39811a090d813c08c4c3552062c2aa77b8788 [2022-04-18 20:22:36,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 20:22:36,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 20:22:36,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 20:22:36,121 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 20:22:36,121 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 20:22:36,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2022-04-18 20:22:36,186 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6984f81e2/afb4de2f46274ca880c2c2317cfcedc2/FLAG9f45c9f3e [2022-04-18 20:22:36,521 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 20:22:36,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2022-04-18 20:22:36,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6984f81e2/afb4de2f46274ca880c2c2317cfcedc2/FLAG9f45c9f3e [2022-04-18 20:22:36,952 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6984f81e2/afb4de2f46274ca880c2c2317cfcedc2 [2022-04-18 20:22:36,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 20:22:36,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 20:22:36,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 20:22:36,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 20:22:36,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 20:22:36,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 08:22:36" (1/1) ... [2022-04-18 20:22:36,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d29392e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:22:36, skipping insertion in model container [2022-04-18 20:22:36,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 08:22:36" (1/1) ... [2022-04-18 20:22:36,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 20:22:36,987 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 20:22:37,132 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-min.wvr.c[2815,2828] [2022-04-18 20:22:37,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 20:22:37,143 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 20:22:37,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c[2815,2828] [2022-04-18 20:22:37,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 20:22:37,179 INFO L208 MainTranslator]: Completed translation [2022-04-18 20:22:37,180 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,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 20:22:37,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 20:22:37,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 20:22:37,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 20:22:37,185 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,194 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,222 INFO L137 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 371 [2022-04-18 20:22:37,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 20:22:37,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 20:22:37,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 20:22:37,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 20:22:37,228 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,228 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,233 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,237 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,260 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,264 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,265 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,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 20:22:37,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 20:22:37,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 20:22:37,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 20:22:37,271 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,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 20:22:37,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:22:37,320 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,323 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,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 20:22:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 20:22:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 20:22:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-18 20:22:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-04-18 20:22:37,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-04-18 20:22:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-04-18 20:22:37,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-04-18 20:22:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-04-18 20:22:37,354 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-04-18 20:22:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 20:22:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-04-18 20:22:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-04-18 20:22:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-18 20:22:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 20:22:37,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 20:22:37,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 20:22:37,356 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:37,443 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 20:22:37,444 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 20:22:37,948 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 20:22:38,080 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 20:22:38,080 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-18 20:22:38,083 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,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 20:22:38,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 20:22:38,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 20:22:38,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 20:22:38,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 08:22:36" (1/3) ... [2022-04-18 20:22:38,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3ceee3 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,088 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,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3ceee3 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,090 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,091 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2022-04-18 20:22:38,096 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 20:22:38,096 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 20:22:38,096 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2022-04-18 20:22:38,096 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 20:22:38,185 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-04-18 20:22:38,225 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 20:22:38,231 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:38,232 INFO L341 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2022-04-18 20:22:38,249 INFO L116 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-04-18 20:22:38,260 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 511 places, 528 transitions, 1080 flow [2022-04-18 20:22:38,262 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 511 places, 528 transitions, 1080 flow [2022-04-18 20:22:38,264 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 511 places, 528 transitions, 1080 flow [2022-04-18 20:22:38,391 INFO L129 PetriNetUnfolder]: 27/525 cut-off events. [2022-04-18 20:22:38,391 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-04-18 20:22:38,402 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:38,422 INFO L116 LiptonReduction]: Number of co-enabled transitions 13362 [2022-04-18 20:26:41,462 INFO L131 LiptonReduction]: Checked pairs total: 93489 [2022-04-18 20:26:41,463 INFO L133 LiptonReduction]: Total number of compositions: 654 [2022-04-18 20:26:41,472 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 130 places, 132 transitions, 288 flow [2022-04-18 20:26:42,917 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:43,029 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:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-04-18 20:26:43,033 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:43,033 INFO L499 BasicCegarLoop]: trace histogram [1] [2022-04-18 20:26:43,033 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:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:43,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2152, now seen corresponding path program 1 times [2022-04-18 20:26:43,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:43,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006259673] [2022-04-18 20:26:43,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:43,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:43,117 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:43,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:43,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006259673] [2022-04-18 20:26:43,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006259673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:26:43,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:26:43,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-04-18 20:26:43,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425618378] [2022-04-18 20:26:43,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:26:43,124 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-18 20:26:43,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:43,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-18 20:26:43,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 20:26:43,222 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:43,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:43,608 INFO L93 Difference]: Finished difference Result 5616 states and 22643 transitions. [2022-04-18 20:26:43,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 20:26:43,619 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:43,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:43,666 INFO L225 Difference]: With dead ends: 5616 [2022-04-18 20:26:43,666 INFO L226 Difference]: Without dead ends: 5585 [2022-04-18 20:26:43,667 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:43,669 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:26:43,670 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.2s Time] [2022-04-18 20:26:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5585 states. [2022-04-18 20:26:43,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5585 to 5585. [2022-04-18 20:26:43,863 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:43,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5585 states to 5585 states and 22556 transitions. [2022-04-18 20:26:43,894 INFO L78 Accepts]: Start accepts. Automaton has 5585 states and 22556 transitions. Word has length 1 [2022-04-18 20:26:43,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:43,895 INFO L478 AbstractCegarLoop]: Abstraction has 5585 states and 22556 transitions. [2022-04-18 20:26:43,895 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:43,895 INFO L276 IsEmpty]: Start isEmpty. Operand 5585 states and 22556 transitions. [2022-04-18 20:26:43,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-18 20:26:43,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:43,897 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:26:43,897 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 20:26:43,898 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:43,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:43,900 INFO L85 PathProgramCache]: Analyzing trace with hash 308507361, now seen corresponding path program 1 times [2022-04-18 20:26:43,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:43,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557059628] [2022-04-18 20:26:43,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:43,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:44,147 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:44,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:44,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557059628] [2022-04-18 20:26:44,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557059628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:26:44,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:26:44,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 20:26:44,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953900315] [2022-04-18 20:26:44,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:26:44,149 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 20:26:44,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:44,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 20:26:44,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 20:26:44,150 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:44,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:44,420 INFO L93 Difference]: Finished difference Result 5586 states and 22557 transitions. [2022-04-18 20:26:44,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 20:26:44,421 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:44,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:44,539 INFO L225 Difference]: With dead ends: 5586 [2022-04-18 20:26:44,539 INFO L226 Difference]: Without dead ends: 5586 [2022-04-18 20:26:44,539 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:44,540 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:44,540 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:44,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5586 states. [2022-04-18 20:26:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5586 to 5586. [2022-04-18 20:26:44,645 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:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5586 states to 5586 states and 22557 transitions. [2022-04-18 20:26:44,664 INFO L78 Accepts]: Start accepts. Automaton has 5586 states and 22557 transitions. Word has length 13 [2022-04-18 20:26:44,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:44,665 INFO L478 AbstractCegarLoop]: Abstraction has 5586 states and 22557 transitions. [2022-04-18 20:26:44,665 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:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand 5586 states and 22557 transitions. [2022-04-18 20:26:44,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-18 20:26:44,666 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:44,666 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:26:44,666 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-18 20:26:44,666 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:44,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:44,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1205302724, now seen corresponding path program 1 times [2022-04-18 20:26:44,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:44,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364776421] [2022-04-18 20:26:44,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:44,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:44,831 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:44,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:44,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364776421] [2022-04-18 20:26:44,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364776421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:26:44,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:26:44,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:26:44,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815253481] [2022-04-18 20:26:44,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:26:44,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:26:44,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:44,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:26:44,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:26:44,832 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:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:46,281 INFO L93 Difference]: Finished difference Result 9026 states and 36659 transitions. [2022-04-18 20:26:46,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:26:46,282 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:46,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:46,324 INFO L225 Difference]: With dead ends: 9026 [2022-04-18 20:26:46,325 INFO L226 Difference]: Without dead ends: 9026 [2022-04-18 20:26:46,325 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:46,326 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 80 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.3s IncrementalHoareTripleChecker+Time [2022-04-18 20:26:46,326 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.3s Time] [2022-04-18 20:26:46,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9026 states. [2022-04-18 20:26:46,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9026 to 6506. [2022-04-18 20:26:46,501 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:46,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 26393 transitions. [2022-04-18 20:26:46,526 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 26393 transitions. Word has length 14 [2022-04-18 20:26:46,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:46,526 INFO L478 AbstractCegarLoop]: Abstraction has 6506 states and 26393 transitions. [2022-04-18 20:26:46,527 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:46,527 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 26393 transitions. [2022-04-18 20:26:46,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-18 20:26:46,528 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:46,528 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:46,528 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-18 20:26:46,528 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:46,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:46,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1290340710, now seen corresponding path program 1 times [2022-04-18 20:26:46,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:46,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540884051] [2022-04-18 20:26:46,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:46,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:46,583 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:46,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:46,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540884051] [2022-04-18 20:26:46,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540884051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:26:46,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:26:46,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 20:26:46,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414609723] [2022-04-18 20:26:46,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:26:46,584 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 20:26:46,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:46,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 20:26:46,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 20:26:46,585 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:46,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:46,868 INFO L93 Difference]: Finished difference Result 10116 states and 41047 transitions. [2022-04-18 20:26:46,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 20:26:46,868 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:46,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:46,907 INFO L225 Difference]: With dead ends: 10116 [2022-04-18 20:26:46,907 INFO L226 Difference]: Without dead ends: 10116 [2022-04-18 20:26:46,908 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:46,908 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:46,909 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:46,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10116 states. [2022-04-18 20:26:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10116 to 6336. [2022-04-18 20:26:47,170 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:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6336 states to 6336 states and 25713 transitions. [2022-04-18 20:26:47,190 INFO L78 Accepts]: Start accepts. Automaton has 6336 states and 25713 transitions. Word has length 15 [2022-04-18 20:26:47,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:47,190 INFO L478 AbstractCegarLoop]: Abstraction has 6336 states and 25713 transitions. [2022-04-18 20:26:47,190 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:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 6336 states and 25713 transitions. [2022-04-18 20:26:47,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-18 20:26:47,199 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:47,200 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:47,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-18 20:26:47,203 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:47,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:47,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1239192769, now seen corresponding path program 1 times [2022-04-18 20:26:47,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:47,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722744445] [2022-04-18 20:26:47,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:47,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:47,287 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:47,288 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:47,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722744445] [2022-04-18 20:26:47,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722744445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:26:47,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:26:47,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 20:26:47,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207909298] [2022-04-18 20:26:47,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:26:47,289 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-18 20:26:47,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:47,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-18 20:26:47,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-18 20:26:47,290 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:47,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:47,497 INFO L93 Difference]: Finished difference Result 6338 states and 25715 transitions. [2022-04-18 20:26:47,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-18 20:26:47,499 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:47,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:47,519 INFO L225 Difference]: With dead ends: 6338 [2022-04-18 20:26:47,520 INFO L226 Difference]: Without dead ends: 6338 [2022-04-18 20:26:47,520 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:47,520 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 67 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:47,521 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:47,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2022-04-18 20:26:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 6338. [2022-04-18 20:26:47,636 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:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6338 states to 6338 states and 25715 transitions. [2022-04-18 20:26:47,656 INFO L78 Accepts]: Start accepts. Automaton has 6338 states and 25715 transitions. Word has length 16 [2022-04-18 20:26:47,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:47,656 INFO L478 AbstractCegarLoop]: Abstraction has 6338 states and 25715 transitions. [2022-04-18 20:26:47,656 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:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 6338 states and 25715 transitions. [2022-04-18 20:26:47,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-18 20:26:47,658 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:47,658 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:47,658 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-18 20:26:47,658 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:47,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:47,658 INFO L85 PathProgramCache]: Analyzing trace with hash -344031214, now seen corresponding path program 1 times [2022-04-18 20:26:47,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:47,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982032236] [2022-04-18 20:26:47,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:47,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:47,803 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:47,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:47,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982032236] [2022-04-18 20:26:47,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982032236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:26:47,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:26:47,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:26:47,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139716488] [2022-04-18 20:26:47,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:26:47,804 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:26:47,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:47,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:26:47,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:26:47,804 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:49,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:49,034 INFO L93 Difference]: Finished difference Result 9223 states and 37357 transitions. [2022-04-18 20:26:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:26:49,035 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:49,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:49,064 INFO L225 Difference]: With dead ends: 9223 [2022-04-18 20:26:49,065 INFO L226 Difference]: Without dead ends: 9223 [2022-04-18 20:26:49,065 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:49,066 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 112 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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:49,066 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:49,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9223 states. [2022-04-18 20:26:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9223 to 8533. [2022-04-18 20:26:49,243 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:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8533 states to 8533 states and 35104 transitions. [2022-04-18 20:26:49,411 INFO L78 Accepts]: Start accepts. Automaton has 8533 states and 35104 transitions. Word has length 18 [2022-04-18 20:26:49,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:49,415 INFO L478 AbstractCegarLoop]: Abstraction has 8533 states and 35104 transitions. [2022-04-18 20:26:49,416 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:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 8533 states and 35104 transitions. [2022-04-18 20:26:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 20:26:49,420 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:49,420 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:49,420 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-18 20:26:49,420 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:49,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:49,421 INFO L85 PathProgramCache]: Analyzing trace with hash 484657626, now seen corresponding path program 1 times [2022-04-18 20:26:49,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:49,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609009059] [2022-04-18 20:26:49,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:49,421 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,579 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:49,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:49,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609009059] [2022-04-18 20:26:49,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609009059] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:26:49,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405127008] [2022-04-18 20:26:49,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:49,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:26:49,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:26:49,581 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:49,593 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:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:49,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-18 20:26:49,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:26:49,942 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:49,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:26:50,073 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:50,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405127008] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:26:50,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [369045692] [2022-04-18 20:26:50,079 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:50,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:26:50,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-18 20:26:50,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625172574] [2022-04-18 20:26:50,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:26:50,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-18 20:26:50,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:50,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-18 20:26:50,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-04-18 20:26:50,083 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:51,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:51,324 INFO L93 Difference]: Finished difference Result 9581 states and 38984 transitions. [2022-04-18 20:26:51,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-18 20:26:51,324 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:51,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:51,351 INFO L225 Difference]: With dead ends: 9581 [2022-04-18 20:26:51,351 INFO L226 Difference]: Without dead ends: 9581 [2022-04-18 20:26:51,352 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:51,352 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 133 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:26:51,352 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.1s Time] [2022-04-18 20:26:51,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9581 states. [2022-04-18 20:26:51,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9581 to 9216. [2022-04-18 20:26:51,512 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:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 37850 transitions. [2022-04-18 20:26:51,540 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 37850 transitions. Word has length 21 [2022-04-18 20:26:51,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:51,540 INFO L478 AbstractCegarLoop]: Abstraction has 9216 states and 37850 transitions. [2022-04-18 20:26:51,541 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:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 37850 transitions. [2022-04-18 20:26:51,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 20:26:51,543 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:51,543 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:51,561 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:51,751 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:51,752 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:51,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:51,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1601753119, now seen corresponding path program 1 times [2022-04-18 20:26:51,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:51,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234642337] [2022-04-18 20:26:51,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:51,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:51,869 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:51,870 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:51,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234642337] [2022-04-18 20:26:51,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234642337] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:26:51,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946017099] [2022-04-18 20:26:51,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:51,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:26:51,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:26:51,871 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:51,872 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:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:52,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-18 20:26:52,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:26:52,156 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:52,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:26:52,252 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:52,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946017099] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:26:52,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [997012488] [2022-04-18 20:26:52,253 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:52,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:26:52,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-18 20:26:52,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6936490] [2022-04-18 20:26:52,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:26:52,254 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-18 20:26:52,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:52,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-18 20:26:52,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-04-18 20:26:52,254 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:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:52,928 INFO L93 Difference]: Finished difference Result 9281 states and 37616 transitions. [2022-04-18 20:26:52,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-18 20:26:52,928 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:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:52,955 INFO L225 Difference]: With dead ends: 9281 [2022-04-18 20:26:52,955 INFO L226 Difference]: Without dead ends: 9281 [2022-04-18 20:26:52,955 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:52,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:52,956 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:26:52,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9281 states. [2022-04-18 20:26:53,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9281 to 9209. [2022-04-18 20:26:53,184 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:26:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9209 states to 9209 states and 37465 transitions. [2022-04-18 20:26:53,210 INFO L78 Accepts]: Start accepts. Automaton has 9209 states and 37465 transitions. Word has length 21 [2022-04-18 20:26:53,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:53,211 INFO L478 AbstractCegarLoop]: Abstraction has 9209 states and 37465 transitions. [2022-04-18 20:26:53,211 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:26:53,211 INFO L276 IsEmpty]: Start isEmpty. Operand 9209 states and 37465 transitions. [2022-04-18 20:26:53,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-18 20:26:53,215 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:53,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:26:53,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-18 20:26:53,419 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:26:53,420 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:26:53,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:53,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1394059000, now seen corresponding path program 2 times [2022-04-18 20:26:53,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:53,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357185916] [2022-04-18 20:26:53,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:53,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:53,827 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:26:53,827 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:53,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357185916] [2022-04-18 20:26:53,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357185916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:26:53,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:26:53,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-18 20:26:53,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907664013] [2022-04-18 20:26:53,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:26:53,828 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-18 20:26:53,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:53,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-18 20:26:53,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-18 20:26:53,829 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:26:56,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:56,055 INFO L93 Difference]: Finished difference Result 22681 states and 92305 transitions. [2022-04-18 20:26:56,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-18 20:26:56,056 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:26:56,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:56,126 INFO L225 Difference]: With dead ends: 22681 [2022-04-18 20:26:56,126 INFO L226 Difference]: Without dead ends: 22681 [2022-04-18 20:26:56,127 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2022-04-18 20:26:56,127 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 515 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.7s IncrementalHoareTripleChecker+Time [2022-04-18 20:26:56,127 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.7s Time] [2022-04-18 20:26:56,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22681 states. [2022-04-18 20:26:56,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22681 to 11328. [2022-04-18 20:26:56,417 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:26:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11328 states to 11328 states and 47151 transitions. [2022-04-18 20:26:56,584 INFO L78 Accepts]: Start accepts. Automaton has 11328 states and 47151 transitions. Word has length 24 [2022-04-18 20:26:56,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:56,584 INFO L478 AbstractCegarLoop]: Abstraction has 11328 states and 47151 transitions. [2022-04-18 20:26:56,584 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:26:56,585 INFO L276 IsEmpty]: Start isEmpty. Operand 11328 states and 47151 transitions. [2022-04-18 20:26:56,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-18 20:26:56,589 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:56,589 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:26:56,589 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-18 20:26:56,589 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:26:56,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:56,590 INFO L85 PathProgramCache]: Analyzing trace with hash -276963507, now seen corresponding path program 2 times [2022-04-18 20:26:56,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:56,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423155297] [2022-04-18 20:26:56,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:56,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:56,895 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:26:56,896 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:56,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423155297] [2022-04-18 20:26:56,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423155297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:26:56,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:26:56,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-18 20:26:56,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135105831] [2022-04-18 20:26:56,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:26:56,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-18 20:26:56,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:56,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-18 20:26:56,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:26:56,897 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:26:58,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:58,171 INFO L93 Difference]: Finished difference Result 10613 states and 44018 transitions. [2022-04-18 20:26:58,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-18 20:26:58,171 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:26:58,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:58,205 INFO L225 Difference]: With dead ends: 10613 [2022-04-18 20:26:58,205 INFO L226 Difference]: Without dead ends: 10613 [2022-04-18 20:26:58,206 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-04-18 20:26:58,206 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 274 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:26:58,206 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 66 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-18 20:26:58,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10613 states. [2022-04-18 20:26:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10613 to 7753. [2022-04-18 20:26:58,383 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:26:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7753 states to 7753 states and 31486 transitions. [2022-04-18 20:26:58,409 INFO L78 Accepts]: Start accepts. Automaton has 7753 states and 31486 transitions. Word has length 24 [2022-04-18 20:26:58,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:58,409 INFO L478 AbstractCegarLoop]: Abstraction has 7753 states and 31486 transitions. [2022-04-18 20:26:58,409 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:26:58,410 INFO L276 IsEmpty]: Start isEmpty. Operand 7753 states and 31486 transitions. [2022-04-18 20:26:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-18 20:26:58,414 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:58,414 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:26:58,414 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-18 20:26:58,414 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:26:58,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:58,415 INFO L85 PathProgramCache]: Analyzing trace with hash -781660367, now seen corresponding path program 1 times [2022-04-18 20:26:58,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:58,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229225478] [2022-04-18 20:26:58,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:58,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:58,547 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:26:58,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:58,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229225478] [2022-04-18 20:26:58,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229225478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:26:58,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:26:58,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:26:58,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430769887] [2022-04-18 20:26:58,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:26:58,548 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:26:58,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:58,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:26:58,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:26:58,549 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:26:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:26:59,566 INFO L93 Difference]: Finished difference Result 9118 states and 37065 transitions. [2022-04-18 20:26:59,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:26:59,566 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:26:59,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:26:59,593 INFO L225 Difference]: With dead ends: 9118 [2022-04-18 20:26:59,593 INFO L226 Difference]: Without dead ends: 9118 [2022-04-18 20:26:59,594 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:59,594 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 60 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:26:59,594 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 71 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-18 20:26:59,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9118 states. [2022-04-18 20:26:59,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9118 to 8563. [2022-04-18 20:26:59,829 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:26:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8563 states to 8563 states and 34845 transitions. [2022-04-18 20:26:59,852 INFO L78 Accepts]: Start accepts. Automaton has 8563 states and 34845 transitions. Word has length 25 [2022-04-18 20:26:59,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:26:59,852 INFO L478 AbstractCegarLoop]: Abstraction has 8563 states and 34845 transitions. [2022-04-18 20:26:59,852 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:26:59,852 INFO L276 IsEmpty]: Start isEmpty. Operand 8563 states and 34845 transitions. [2022-04-18 20:26:59,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-18 20:26:59,857 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:26:59,857 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:26:59,857 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-18 20:26:59,858 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:26:59,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:26:59,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1564882616, now seen corresponding path program 1 times [2022-04-18 20:26:59,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:26:59,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849276633] [2022-04-18 20:26:59,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:26:59,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:26:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:26:59,978 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:59,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:26:59,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849276633] [2022-04-18 20:26:59,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849276633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:26:59,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:26:59,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:26:59,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557860755] [2022-04-18 20:26:59,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:26:59,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:26:59,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:26:59,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:26:59,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:26:59,979 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:00,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:27:00,829 INFO L93 Difference]: Finished difference Result 8603 states and 34958 transitions. [2022-04-18 20:27:00,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:27:00,829 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:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:27:00,854 INFO L225 Difference]: With dead ends: 8603 [2022-04-18 20:27:00,854 INFO L226 Difference]: Without dead ends: 6916 [2022-04-18 20:27:00,854 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:27:00,855 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 32 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-04-18 20:27:00,855 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.8s Time] [2022-04-18 20:27:00,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6916 states. [2022-04-18 20:27:00,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6916 to 6916. [2022-04-18 20:27:00,961 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:00,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6916 states to 6916 states and 27779 transitions. [2022-04-18 20:27:00,980 INFO L78 Accepts]: Start accepts. Automaton has 6916 states and 27779 transitions. Word has length 28 [2022-04-18 20:27:00,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:27:00,980 INFO L478 AbstractCegarLoop]: Abstraction has 6916 states and 27779 transitions. [2022-04-18 20:27:00,980 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:00,980 INFO L276 IsEmpty]: Start isEmpty. Operand 6916 states and 27779 transitions. [2022-04-18 20:27:00,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-18 20:27:00,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:27:00,985 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:00,985 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-18 20:27:00,985 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:00,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:27:00,985 INFO L85 PathProgramCache]: Analyzing trace with hash -446611490, now seen corresponding path program 1 times [2022-04-18 20:27:00,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:27:00,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286569039] [2022-04-18 20:27:00,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:27:00,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:27:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:27:01,249 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:01,249 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:27:01,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286569039] [2022-04-18 20:27:01,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286569039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:27:01,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:27:01,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-18 20:27:01,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041163689] [2022-04-18 20:27:01,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:27:01,250 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-18 20:27:01,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:27:01,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-18 20:27:01,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:27:01,251 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:03,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:27:03,368 INFO L93 Difference]: Finished difference Result 13296 states and 53151 transitions. [2022-04-18 20:27:03,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-18 20:27:03,368 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:03,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:27:03,410 INFO L225 Difference]: With dead ends: 13296 [2022-04-18 20:27:03,411 INFO L226 Difference]: Without dead ends: 12889 [2022-04-18 20:27:03,411 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:03,412 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 422 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.7s IncrementalHoareTripleChecker+Time [2022-04-18 20:27:03,412 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.7s Time] [2022-04-18 20:27:03,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12889 states. [2022-04-18 20:27:03,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12889 to 8272. [2022-04-18 20:27:03,593 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:03,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8272 states to 8272 states and 33268 transitions. [2022-04-18 20:27:03,619 INFO L78 Accepts]: Start accepts. Automaton has 8272 states and 33268 transitions. Word has length 30 [2022-04-18 20:27:03,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:27:03,619 INFO L478 AbstractCegarLoop]: Abstraction has 8272 states and 33268 transitions. [2022-04-18 20:27:03,620 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:03,620 INFO L276 IsEmpty]: Start isEmpty. Operand 8272 states and 33268 transitions. [2022-04-18 20:27:03,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-18 20:27:03,625 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:27:03,625 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:03,625 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-18 20:27:03,625 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:03,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:27:03,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1196612163, now seen corresponding path program 1 times [2022-04-18 20:27:03,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:27:03,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162082977] [2022-04-18 20:27:03,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:27:03,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:27:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:27:03,767 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:03,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:27:03,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162082977] [2022-04-18 20:27:03,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162082977] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:27:03,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004615433] [2022-04-18 20:27:03,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:27:03,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:27:03,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:27:03,769 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:03,769 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:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:27:03,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-18 20:27:03,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:27:04,144 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:04,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:27:04,315 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:04,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004615433] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-18 20:27:04,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-18 20:27:04,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2022-04-18 20:27:04,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684229508] [2022-04-18 20:27:04,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:27:04,316 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:27:04,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:27:04,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:27:04,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-04-18 20:27:04,317 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:04,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:27:04,629 INFO L93 Difference]: Finished difference Result 8272 states and 33155 transitions. [2022-04-18 20:27:04,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:27:04,630 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:04,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:27:04,656 INFO L225 Difference]: With dead ends: 8272 [2022-04-18 20:27:04,656 INFO L226 Difference]: Without dead ends: 8272 [2022-04-18 20:27:04,656 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:04,657 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:04,657 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:04,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8272 states. [2022-04-18 20:27:04,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8272 to 8272. [2022-04-18 20:27:04,877 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:04,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8272 states to 8272 states and 33155 transitions. [2022-04-18 20:27:04,899 INFO L78 Accepts]: Start accepts. Automaton has 8272 states and 33155 transitions. Word has length 34 [2022-04-18 20:27:04,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:27:04,899 INFO L478 AbstractCegarLoop]: Abstraction has 8272 states and 33155 transitions. [2022-04-18 20:27:04,899 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:04,899 INFO L276 IsEmpty]: Start isEmpty. Operand 8272 states and 33155 transitions. [2022-04-18 20:27:04,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-18 20:27:04,906 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:27:04,906 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:04,923 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:05,107 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:05,107 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:05,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:27:05,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1821843223, now seen corresponding path program 1 times [2022-04-18 20:27:05,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:27:05,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455045725] [2022-04-18 20:27:05,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:27:05,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:27:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:27:05,284 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:05,284 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:27:05,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455045725] [2022-04-18 20:27:05,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455045725] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:27:05,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525244794] [2022-04-18 20:27:05,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:27:05,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:27:05,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:27:05,286 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:05,287 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:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:27:05,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-18 20:27:05,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:27:05,768 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:05,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:27:05,969 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:05,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525244794] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:27:05,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [967950381] [2022-04-18 20:27:05,970 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:05,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:27:05,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-04-18 20:27:05,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804997282] [2022-04-18 20:27:05,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:27:05,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-18 20:27:05,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:27:05,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-18 20:27:05,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-04-18 20:27:05,971 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:07,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:27:07,667 INFO L93 Difference]: Finished difference Result 11724 states and 46788 transitions. [2022-04-18 20:27:07,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:27:07,668 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:07,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:27:07,701 INFO L225 Difference]: With dead ends: 11724 [2022-04-18 20:27:07,701 INFO L226 Difference]: Without dead ends: 11724 [2022-04-18 20:27:07,701 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:07,702 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 226 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.5s IncrementalHoareTripleChecker+Time [2022-04-18 20:27:07,702 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.5s Time] [2022-04-18 20:27:07,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11724 states. [2022-04-18 20:27:07,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11724 to 11446. [2022-04-18 20:27:07,885 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:07,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11446 states to 11446 states and 45940 transitions. [2022-04-18 20:27:07,916 INFO L78 Accepts]: Start accepts. Automaton has 11446 states and 45940 transitions. Word has length 37 [2022-04-18 20:27:07,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:27:07,917 INFO L478 AbstractCegarLoop]: Abstraction has 11446 states and 45940 transitions. [2022-04-18 20:27:07,917 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:07,917 INFO L276 IsEmpty]: Start isEmpty. Operand 11446 states and 45940 transitions. [2022-04-18 20:27:07,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-18 20:27:07,931 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:27:07,931 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:07,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-18 20:27:08,131 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:08,132 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:08,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:27:08,132 INFO L85 PathProgramCache]: Analyzing trace with hash -836183163, now seen corresponding path program 2 times [2022-04-18 20:27:08,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:27:08,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574426215] [2022-04-18 20:27:08,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:27:08,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:27:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:27:08,486 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:08,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:27:08,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574426215] [2022-04-18 20:27:08,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574426215] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:27:08,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297782591] [2022-04-18 20:27:08,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:27:08,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:27:08,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:27:08,487 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:08,488 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:08,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:27:08,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:27:08,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-18 20:27:08,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:27:08,803 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:27:08,804 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:08,872 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:27:08,873 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:08,949 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:27:08,949 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:09,263 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:09,387 INFO L356 Elim1Store]: treesize reduction 502, result has 8.6 percent of original size [2022-04-18 20:27:09,388 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:09,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:12,182 INFO L356 Elim1Store]: treesize reduction 371, result has 13.7 percent of original size [2022-04-18 20:27:12,182 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:16,442 INFO L356 Elim1Store]: treesize reduction 500, result has 12.4 percent of original size [2022-04-18 20:27:16,442 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:19,259 INFO L356 Elim1Store]: treesize reduction 647, result has 11.4 percent of original size [2022-04-18 20:27:19,261 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:19,323 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:19,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:27:19,373 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:19,464 INFO L356 Elim1Store]: treesize reduction 522, result has 10.9 percent of original size [2022-04-18 20:27:19,465 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:19,474 INFO L356 Elim1Store]: treesize reduction 172, result has 0.6 percent of original size [2022-04-18 20:27:19,474 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:19,478 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:19,490 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:20,003 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:20,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297782591] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:27:20,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1294990887] [2022-04-18 20:27:20,004 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:20,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:27:20,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 22 [2022-04-18 20:27:20,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420610628] [2022-04-18 20:27:20,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:27:20,005 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-18 20:27:20,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:27:20,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-18 20:27:20,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=423, Unknown=6, NotChecked=42, Total=552 [2022-04-18 20:27:20,005 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:21,532 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:29,848 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,548 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:53,652 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:16,463 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:17,750 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:18,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:28:18,051 INFO L93 Difference]: Finished difference Result 44514 states and 180746 transitions. [2022-04-18 20:28:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-18 20:28:18,053 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:18,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:28:18,192 INFO L225 Difference]: With dead ends: 44514 [2022-04-18 20:28:18,193 INFO L226 Difference]: Without dead ends: 44148 [2022-04-18 20:28:18,193 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 64.6s TimeCoverageRelationStatistics Valid=404, Invalid=1481, Unknown=35, NotChecked=630, Total=2550 [2022-04-18 20:28:18,194 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 595 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:28:18,194 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.0s Time] [2022-04-18 20:28:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44148 states. [2022-04-18 20:28:18,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44148 to 18345. [2022-04-18 20:28:18,719 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:18,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18345 states to 18345 states and 75071 transitions. [2022-04-18 20:28:18,776 INFO L78 Accepts]: Start accepts. Automaton has 18345 states and 75071 transitions. Word has length 40 [2022-04-18 20:28:18,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:28:18,777 INFO L478 AbstractCegarLoop]: Abstraction has 18345 states and 75071 transitions. [2022-04-18 20:28:18,777 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:18,777 INFO L276 IsEmpty]: Start isEmpty. Operand 18345 states and 75071 transitions. [2022-04-18 20:28:18,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-18 20:28:18,796 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:28:18,796 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:18,812 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:18,996 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:18,997 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:18,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:28:18,997 INFO L85 PathProgramCache]: Analyzing trace with hash 95081787, now seen corresponding path program 3 times [2022-04-18 20:28:18,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:28:18,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920233908] [2022-04-18 20:28:18,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:28:18,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:28:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:28:19,374 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:19,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:28:19,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920233908] [2022-04-18 20:28:19,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920233908] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:28:19,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554890487] [2022-04-18 20:28:19,374 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:28:19,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:28:19,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:28:19,375 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:19,376 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:19,669 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:28:19,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:28:19,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-18 20:28:19,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:28:19,726 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:28:19,726 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:19,816 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:28:19,816 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:19,881 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:28:19,881 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:20,262 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:20,379 INFO L356 Elim1Store]: treesize reduction 360, result has 9.8 percent of original size [2022-04-18 20:28:20,380 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:20,388 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:20,489 INFO L356 Elim1Store]: treesize reduction 294, result has 14.0 percent of original size [2022-04-18 20:28:20,489 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:20,629 INFO L356 Elim1Store]: treesize reduction 412, result has 12.7 percent of original size [2022-04-18 20:28:20,629 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:20,803 INFO L356 Elim1Store]: treesize reduction 548, result has 11.6 percent of original size [2022-04-18 20:28:20,803 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:20,868 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:20,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:28:20,908 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:20,993 INFO L356 Elim1Store]: treesize reduction 522, result has 10.9 percent of original size [2022-04-18 20:28:20,993 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:21,002 INFO L356 Elim1Store]: treesize reduction 172, result has 0.6 percent of original size [2022-04-18 20:28:21,003 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:21,022 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:21,027 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:21,484 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:21,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554890487] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:28:21,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [125818196] [2022-04-18 20:28:21,484 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:21,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:28:21,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 9] total 29 [2022-04-18 20:28:21,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126068817] [2022-04-18 20:28:21,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:28:21,486 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-18 20:28:21,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:28:21,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-18 20:28:21,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=751, Unknown=1, NotChecked=56, Total=930 [2022-04-18 20:28:21,487 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,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:28:28,858 INFO L93 Difference]: Finished difference Result 44214 states and 181253 transitions. [2022-04-18 20:28:28,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-18 20:28:28,859 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,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:28:28,999 INFO L225 Difference]: With dead ends: 44214 [2022-04-18 20:28:28,999 INFO L226 Difference]: Without dead ends: 43482 [2022-04-18 20:28:29,000 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=876, Invalid=3287, Unknown=1, NotChecked=126, Total=4290 [2022-04-18 20:28:29,001 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 795 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 3264 mSolverCounterSat, 592 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s 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, 5.7s IncrementalHoareTripleChecker+Time [2022-04-18 20:28:29,001 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [795 Valid, 671 Invalid, 4410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [592 Valid, 3264 Invalid, 0 Unknown, 554 Unchecked, 5.7s Time] [2022-04-18 20:28:29,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43482 states. [2022-04-18 20:28:29,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43482 to 10336. [2022-04-18 20:28:29,546 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:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10336 states to 10336 states and 41500 transitions. [2022-04-18 20:28:29,626 INFO L78 Accepts]: Start accepts. Automaton has 10336 states and 41500 transitions. Word has length 40 [2022-04-18 20:28:29,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:28:29,626 INFO L478 AbstractCegarLoop]: Abstraction has 10336 states and 41500 transitions. [2022-04-18 20:28:29,627 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:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 10336 states and 41500 transitions. [2022-04-18 20:28:29,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-18 20:28:29,643 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:28:29,643 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:29,660 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,859 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,859 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,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:28:29,860 INFO L85 PathProgramCache]: Analyzing trace with hash -719114085, now seen corresponding path program 1 times [2022-04-18 20:28:29,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:28:29,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953174911] [2022-04-18 20:28:29,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:28:29,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:28:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:28:30,178 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:30,179 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:28:30,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953174911] [2022-04-18 20:28:30,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953174911] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:28:30,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877752079] [2022-04-18 20:28:30,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:28:30,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:28:30,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:28:30,180 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:30,181 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:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:28:30,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 83 conjunts are in the unsatisfiable core [2022-04-18 20:28:30,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:28:30,505 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:28:30,505 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:30,542 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:28:30,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:28:30,601 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:28:30,602 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:31,025 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:31,234 INFO L356 Elim1Store]: treesize reduction 785, result has 9.5 percent of original size [2022-04-18 20:28:31,235 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 126 treesize of output 115 [2022-04-18 20:28:31,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 103 [2022-04-18 20:28:31,474 INFO L356 Elim1Store]: treesize reduction 476, result has 11.0 percent of original size [2022-04-18 20:28:31,474 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 122 treesize of output 145 [2022-04-18 20:28:31,705 INFO L356 Elim1Store]: treesize reduction 605, result has 10.5 percent of original size [2022-04-18 20:28:31,706 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:32,024 INFO L356 Elim1Store]: treesize reduction 752, result has 9.9 percent of original size [2022-04-18 20:28:32,025 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:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-18 20:28:32,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:28:32,337 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:32,854 INFO L356 Elim1Store]: treesize reduction 2962, result has 3.7 percent of original size [2022-04-18 20:28:32,854 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:32,879 INFO L356 Elim1Store]: treesize reduction 684, result has 0.1 percent of original size [2022-04-18 20:28:32,879 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:32,883 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:33,074 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:33,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877752079] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:28:33,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [307885468] [2022-04-18 20:28:33,075 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:33,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:28:33,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 28 [2022-04-18 20:28:33,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675336481] [2022-04-18 20:28:33,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:28:33,076 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-18 20:28:33,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:28:33,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-18 20:28:33,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=637, Unknown=1, NotChecked=52, Total=812 [2022-04-18 20:28:33,077 INFO L87 Difference]: Start difference. First operand 10336 states and 41500 transitions. Second operand has 29 states, 28 states have (on average 3.7857142857142856) internal successors, (106), 29 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:28:38,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:28:38,585 INFO L93 Difference]: Finished difference Result 32769 states and 134022 transitions. [2022-04-18 20:28:38,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-18 20:28:38,586 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.7857142857142856) internal successors, (106), 29 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-04-18 20:28:38,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:28:38,696 INFO L225 Difference]: With dead ends: 32769 [2022-04-18 20:28:38,696 INFO L226 Difference]: Without dead ends: 32769 [2022-04-18 20:28:38,697 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=718, Invalid=3191, Unknown=1, NotChecked=122, Total=4032 [2022-04-18 20:28:38,697 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 1083 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 2804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 888 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-18 20:28:38,697 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1083 Valid, 672 Invalid, 2804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1739 Invalid, 0 Unknown, 888 Unchecked, 3.8s Time] [2022-04-18 20:28:38,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32769 states. [2022-04-18 20:28:39,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32769 to 14585. [2022-04-18 20:28:39,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14585 states, 14582 states have (on average 4.0574681113701825) internal successors, (59166), 14584 states have internal predecessors, (59166), 0 states have call successors, (0), 0 states have call 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:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14585 states to 14585 states and 59166 transitions. [2022-04-18 20:28:39,199 INFO L78 Accepts]: Start accepts. Automaton has 14585 states and 59166 transitions. Word has length 46 [2022-04-18 20:28:39,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:28:39,199 INFO L478 AbstractCegarLoop]: Abstraction has 14585 states and 59166 transitions. [2022-04-18 20:28:39,199 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.7857142857142856) internal successors, (106), 29 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:28:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand 14585 states and 59166 transitions. [2022-04-18 20:28:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-18 20:28:39,222 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:28:39,222 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:39,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-18 20:28:39,422 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:39,423 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:39,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:28:39,423 INFO L85 PathProgramCache]: Analyzing trace with hash 369966979, now seen corresponding path program 2 times [2022-04-18 20:28:39,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:28:39,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471131992] [2022-04-18 20:28:39,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:28:39,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:28:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:28:39,838 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,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:28:39,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471131992] [2022-04-18 20:28:39,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471131992] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:28:39,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707626271] [2022-04-18 20:28:39,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:28:39,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:28:39,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:28:39,839 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,839 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:40,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:28:40,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:28:40,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 89 conjunts are in the unsatisfiable core [2022-04-18 20:28:40,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:28:40,165 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:28:40,166 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:40,211 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:28:40,211 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:40,285 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:28:40,285 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,585 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,626 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-18 20:28:40,626 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,815 INFO L356 Elim1Store]: treesize reduction 1039, result has 8.3 percent of original size [2022-04-18 20:28:40,816 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,824 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:41,190 INFO L356 Elim1Store]: treesize reduction 605, result has 10.5 percent of original size [2022-04-18 20:28:41,191 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:41,455 INFO L356 Elim1Store]: treesize reduction 752, result has 9.9 percent of original size [2022-04-18 20:28:41,455 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,608 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,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:28:41,654 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:41,693 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~A~0.offset Int) (v_ArrVal_4789 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (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 c_~B~0.offset 1) 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_4789) c_~B~0.base) (+ .cse3 c_~B~0.offset))) 0)) (forall ((~A~0.offset Int) (v_ArrVal_4789 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (let ((.cse7 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1))) (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 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_4789) c_~B~0.base) .cse7)) 0))) is different from false [2022-04-18 20:28:42,249 INFO L356 Elim1Store]: treesize reduction 3897, result has 3.2 percent of original size [2022-04-18 20:28:42,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, 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:28:42,258 INFO L356 Elim1Store]: treesize reduction 855, result has 0.1 percent of original size [2022-04-18 20:28:42,258 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:28:42,550 INFO L356 Elim1Store]: treesize reduction 4024, result has 0.0 percent of original size [2022-04-18 20:28:42,551 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:28:42,684 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:28:42,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707626271] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:28:42,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [479579538] [2022-04-18 20:28:42,684 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,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:28:42,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2022-04-18 20:28:42,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174034477] [2022-04-18 20:28:42,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:28:42,685 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-18 20:28:42,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:28:42,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-18 20:28:42,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=508, Unknown=2, NotChecked=94, Total=702 [2022-04-18 20:28:42,686 INFO L87 Difference]: Start difference. First operand 14585 states and 59166 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:45,538 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)) (= (+ (- 1) c_thread1Thread1of1ForFork2_~i~0) 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:52,031 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)) (= (+ (- 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)) (= (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,780 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:29:05,394 WARN L232 SmtUtils]: Spent 8.47s on a formula simplification. DAG size of input: 63 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-18 20:29:07,464 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:29:08,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:29:08,362 INFO L93 Difference]: Finished difference Result 49405 states and 202457 transitions. [2022-04-18 20:29:08,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-18 20:29:08,363 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:08,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:29:08,541 INFO L225 Difference]: With dead ends: 49405 [2022-04-18 20:29:08,541 INFO L226 Difference]: Without dead ends: 49257 [2022-04-18 20:29:08,542 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 6 IntricatePredicates, 3 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=729, Invalid=2949, Unknown=6, NotChecked=738, Total=4422 [2022-04-18 20:29:08,543 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 730 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 5338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2719 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:29:08,543 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [730 Valid, 708 Invalid, 5338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 2402 Invalid, 0 Unknown, 2719 Unchecked, 4.1s Time] [2022-04-18 20:29:08,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49257 states. [2022-04-18 20:29:09,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49257 to 26471. [2022-04-18 20:29:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26471 states, 26468 states have (on average 4.131592866858092) internal successors, (109355), 26470 states have internal predecessors, (109355), 0 states have call successors, (0), 0 states have call 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:09,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26471 states to 26471 states and 109355 transitions. [2022-04-18 20:29:09,439 INFO L78 Accepts]: Start accepts. Automaton has 26471 states and 109355 transitions. Word has length 46 [2022-04-18 20:29:09,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:29:09,439 INFO L478 AbstractCegarLoop]: Abstraction has 26471 states and 109355 transitions. [2022-04-18 20:29:09,439 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:09,439 INFO L276 IsEmpty]: Start isEmpty. Operand 26471 states and 109355 transitions. [2022-04-18 20:29:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-18 20:29:09,478 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:29:09,478 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:09,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-18 20:29:09,679 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:09,679 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:09,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:29:09,680 INFO L85 PathProgramCache]: Analyzing trace with hash 354975379, now seen corresponding path program 3 times [2022-04-18 20:29:09,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:29:09,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977117891] [2022-04-18 20:29:09,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:29:09,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:29:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:29:10,139 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:10,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:29:10,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977117891] [2022-04-18 20:29:10,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977117891] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:29:10,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125675370] [2022-04-18 20:29:10,139 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:29:10,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:29:10,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:29:10,140 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:10,141 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:10,512 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:29:10,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:29:10,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 91 conjunts are in the unsatisfiable core [2022-04-18 20:29:10,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:29:10,580 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:29:10,581 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:10,640 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:29:10,641 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:10,737 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:29:10,738 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:11,238 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:11,308 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-18 20:29:11,308 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:11,402 INFO L356 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-04-18 20:29:11,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2022-04-18 20:29:11,822 INFO L356 Elim1Store]: treesize reduction 987, result has 8.4 percent of original size [2022-04-18 20:29:11,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 117 treesize of output 123 [2022-04-18 20:29:11,831 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 114 treesize of output 101 [2022-04-18 20:29:12,081 INFO L356 Elim1Store]: treesize reduction 620, result has 10.4 percent of original size [2022-04-18 20:29:12,081 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:12,198 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-18 20:29:12,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:29:12,254 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~A~0.offset Int) (v_ArrVal_5282 (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_5282) c_~B~0.base) (+ 2 (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_5282 (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_5282) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset 1)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_5282 (Array Int Int))) (= (select (select (store (let ((.cse5 (* |c_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) (+ .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_5282) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0))) is different from false [2022-04-18 20:29:15,068 INFO L356 Elim1Store]: treesize reduction 5016, result has 2.7 percent of original size [2022-04-18 20:29:15,068 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 11 case distinctions, treesize of input 234 treesize of output 155 [2022-04-18 20:29:15,079 INFO L356 Elim1Store]: treesize reduction 1044, result has 0.1 percent of original size [2022-04-18 20:29:15,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 170 treesize of output 66 [2022-04-18 20:29:15,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-04-18 20:29:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-18 20:29:15,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125675370] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:29:15,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [304057010] [2022-04-18 20:29:15,227 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:15,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:29:15,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9] total 31 [2022-04-18 20:29:15,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300461786] [2022-04-18 20:29:15,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:29:15,229 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-18 20:29:15,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:29:15,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-18 20:29:15,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=764, Unknown=12, NotChecked=58, Total=992 [2022-04-18 20:29:15,230 INFO L87 Difference]: Start difference. First operand 26471 states and 109355 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:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:29:45,432 INFO L93 Difference]: Finished difference Result 80806 states and 335383 transitions. [2022-04-18 20:29:45,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-18 20:29:45,435 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:45,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:29:45,881 INFO L225 Difference]: With dead ends: 80806 [2022-04-18 20:29:45,881 INFO L226 Difference]: Without dead ends: 80558 [2022-04-18 20:29:45,882 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 77 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=720, Invalid=3164, Unknown=26, NotChecked=122, Total=4032 [2022-04-18 20:29:45,882 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 814 mSDsluCounter, 2531 mSDsCounter, 0 mSdLazyCounter, 3355 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 5753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 3355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2216 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-18 20:29:45,882 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [814 Valid, 967 Invalid, 5753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 3355 Invalid, 0 Unknown, 2216 Unchecked, 6.3s Time] [2022-04-18 20:29:45,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80558 states. [2022-04-18 20:29:47,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80558 to 48778. [2022-04-18 20:29:47,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48778 states, 48775 states have (on average 4.170230650948231) internal successors, (203403), 48777 states have internal predecessors, (203403), 0 states have call successors, (0), 0 states have call 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,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48778 states to 48778 states and 203403 transitions. [2022-04-18 20:29:47,375 INFO L78 Accepts]: Start accepts. Automaton has 48778 states and 203403 transitions. Word has length 46 [2022-04-18 20:29:47,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:29:47,375 INFO L478 AbstractCegarLoop]: Abstraction has 48778 states and 203403 transitions. [2022-04-18 20:29:47,375 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:47,375 INFO L276 IsEmpty]: Start isEmpty. Operand 48778 states and 203403 transitions. [2022-04-18 20:29:47,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-18 20:29:47,442 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:29:47,442 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,460 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:47,642 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:47,643 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:47,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:29:47,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1435716927, now seen corresponding path program 4 times [2022-04-18 20:29:47,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:29:47,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873451793] [2022-04-18 20:29:47,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:29:47,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:29:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:29:48,009 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,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:29:48,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873451793] [2022-04-18 20:29:48,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873451793] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:29:48,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290303789] [2022-04-18 20:29:48,010 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-18 20:29:48,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:29:48,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:29:48,011 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:48,011 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:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:29:48,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 105 conjunts are in the unsatisfiable core [2022-04-18 20:29:48,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:29:48,480 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:29:48,481 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,524 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:29:48,525 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,644 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:29:48,645 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,149 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,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,223 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:29:49,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,398 INFO L356 Elim1Store]: treesize reduction 181, result has 13.4 percent of original size [2022-04-18 20:29:49,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 108 [2022-04-18 20:29:49,404 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:49,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,557 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-04-18 20:29:49,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 22 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 138 [2022-04-18 20:29:49,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:29:49,712 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-04-18 20:29:49,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 29 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 6 case distinctions, treesize of input 124 treesize of output 153 [2022-04-18 20:29:49,820 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:49,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:29:49,883 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:51,287 INFO L356 Elim1Store]: treesize reduction 3897, result has 3.2 percent of original size [2022-04-18 20:29:51,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 202 treesize of output 142 [2022-04-18 20:29:51,299 INFO L356 Elim1Store]: treesize reduction 855, result has 0.1 percent of original size [2022-04-18 20:29:51,300 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:29:51,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-04-18 20:29:51,560 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:51,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290303789] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:29:51,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [368395554] [2022-04-18 20:29:51,560 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:51,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:29:51,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 9] total 31 [2022-04-18 20:29:51,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142413296] [2022-04-18 20:29:51,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:29:51,562 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-18 20:29:51,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:29:51,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-18 20:29:51,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=782, Unknown=8, NotChecked=58, Total=992 [2022-04-18 20:29:51,562 INFO L87 Difference]: Start difference. First operand 48778 states and 203403 transitions. Second operand has 32 states, 31 states have (on average 3.5161290322580645) internal successors, (109), 32 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call 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,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:30:13,234 INFO L93 Difference]: Finished difference Result 130220 states and 549044 transitions. [2022-04-18 20:30:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-18 20:30:13,235 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.5161290322580645) internal successors, (109), 32 states have internal predecessors, (109), 0 states have call successors, (0), 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:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:30:14,141 INFO L225 Difference]: With dead ends: 130220 [2022-04-18 20:30:14,141 INFO L226 Difference]: Without dead ends: 130220 [2022-04-18 20:30:14,142 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 85 SyntacticMatches, 19 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2221 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=664, Invalid=3749, Unknown=13, NotChecked=130, Total=4556 [2022-04-18 20:30:14,143 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 914 mSDsluCounter, 2008 mSDsCounter, 0 mSdLazyCounter, 2078 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 4538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2352 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:30:14,143 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [914 Valid, 942 Invalid, 4538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2078 Invalid, 0 Unknown, 2352 Unchecked, 4.1s Time] [2022-04-18 20:30:14,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130220 states. [2022-04-18 20:30:17,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130220 to 107323. [2022-04-18 20:30:17,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107323 states, 107320 states have (on average 4.234849049571375) internal successors, (454484), 107322 states have internal predecessors, (454484), 0 states have call successors, (0), 0 states have call 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:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107323 states to 107323 states and 454484 transitions. [2022-04-18 20:30:18,018 INFO L78 Accepts]: Start accepts. Automaton has 107323 states and 454484 transitions. Word has length 46 [2022-04-18 20:30:18,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:30:18,018 INFO L478 AbstractCegarLoop]: Abstraction has 107323 states and 454484 transitions. [2022-04-18 20:30:18,018 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.5161290322580645) internal successors, (109), 32 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call 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:18,018 INFO L276 IsEmpty]: Start isEmpty. Operand 107323 states and 454484 transitions. [2022-04-18 20:30:18,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-18 20:30:18,163 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:30:18,163 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:18,181 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:30:18,363 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:30:18,364 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:30:18,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:30:18,365 INFO L85 PathProgramCache]: Analyzing trace with hash 112223433, now seen corresponding path program 5 times [2022-04-18 20:30:18,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:30:18,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705381602] [2022-04-18 20:30:18,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:30:18,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:30:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:30:18,851 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:18,851 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:30:18,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705381602] [2022-04-18 20:30:18,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705381602] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:30:18,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214688235] [2022-04-18 20:30:18,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:30:18,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:30:18,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:30:18,853 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:30:18,854 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:30:19,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:30:19,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:30:19,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-18 20:30:19,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:30:19,263 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:30:19,263 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:19,304 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:30:19,305 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:19,361 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:30:19,362 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:19,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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:19,751 INFO L356 Elim1Store]: treesize reduction 785, result has 9.5 percent of original size [2022-04-18 20:30:19,751 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 126 treesize of output 115 [2022-04-18 20:30:19,756 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 112 treesize of output 103 [2022-04-18 20:30:19,945 INFO L356 Elim1Store]: treesize reduction 476, result has 11.0 percent of original size [2022-04-18 20:30:19,945 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 122 treesize of output 145 [2022-04-18 20:30:20,200 INFO L356 Elim1Store]: treesize reduction 605, result has 10.5 percent of original size [2022-04-18 20:30:20,200 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:30:20,527 INFO L356 Elim1Store]: treesize reduction 752, result has 9.9 percent of original size [2022-04-18 20:30:20,527 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:30:20,686 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:30:20,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:30:20,731 WARN L833 $PredicateComparison]: unable to prove that (forall ((~A~0.offset Int) (v_ArrVal_6275 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= 0 (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_6275) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)))) is different from false [2022-04-18 20:30:21,140 INFO L356 Elim1Store]: treesize reduction 2962, result has 3.7 percent of original size [2022-04-18 20:30:21,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 170 treesize of output 129 [2022-04-18 20:30:21,156 INFO L356 Elim1Store]: treesize reduction 684, result has 0.1 percent of original size [2022-04-18 20:30:21,156 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:30:21,284 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:30:21,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214688235] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:30:21,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1569284851] [2022-04-18 20:30:21,285 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:21,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:30:21,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2022-04-18 20:30:21,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050465848] [2022-04-18 20:30:21,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:30:21,288 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-18 20:30:21,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:30:21,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-18 20:30:21,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=505, Unknown=1, NotChecked=46, Total=650 [2022-04-18 20:30:21,289 INFO L87 Difference]: Start difference. First operand 107323 states and 454484 transitions. Second operand has 26 states, 25 states have (on average 3.92) internal successors, (98), 26 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call 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:35,664 WARN L232 SmtUtils]: Spent 13.36s on a formula simplification. DAG size of input: 65 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-18 20:30:52,070 WARN L232 SmtUtils]: Spent 16.10s on a formula simplification. DAG size of input: 67 DAG size of output: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-18 20:31:00,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:00,409 INFO L93 Difference]: Finished difference Result 162090 states and 683416 transitions. [2022-04-18 20:31:00,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-18 20:31:00,409 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.92) internal successors, (98), 26 states have internal predecessors, (98), 0 states have call successors, (0), 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:31:00,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:01,183 INFO L225 Difference]: With dead ends: 162090 [2022-04-18 20:31:01,183 INFO L226 Difference]: Without dead ends: 162090 [2022-04-18 20:31:01,184 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 114 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 3 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 34.5s TimeCoverageRelationStatistics Valid=862, Invalid=3301, Unknown=1, NotChecked=126, Total=4290 [2022-04-18 20:31:01,185 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 880 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 3614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1578 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:01,185 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [880 Valid, 492 Invalid, 3614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1784 Invalid, 0 Unknown, 1578 Unchecked, 3.5s Time] [2022-04-18 20:31:01,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162090 states. [2022-04-18 20:31:03,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162090 to 27177. [2022-04-18 20:31:03,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27177 states, 27174 states have (on average 4.096121292411865) internal successors, (111308), 27176 states have internal predecessors, (111308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:31:03,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27177 states to 27177 states and 111308 transitions. [2022-04-18 20:31:03,437 INFO L78 Accepts]: Start accepts. Automaton has 27177 states and 111308 transitions. Word has length 46 [2022-04-18 20:31:03,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:03,437 INFO L478 AbstractCegarLoop]: Abstraction has 27177 states and 111308 transitions. [2022-04-18 20:31:03,437 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.92) internal successors, (98), 26 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:31:03,437 INFO L276 IsEmpty]: Start isEmpty. Operand 27177 states and 111308 transitions. [2022-04-18 20:31:03,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-18 20:31:03,481 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:03,481 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:31:03,499 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:31:03,681 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:31:03,682 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:31:03,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:03,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1252491524, now seen corresponding path program 1 times [2022-04-18 20:31:03,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:31:03,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361155726] [2022-04-18 20:31:03,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:31:03,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:31:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:31:03,929 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:31:03,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:31:03,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361155726] [2022-04-18 20:31:03,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361155726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:31:03,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:31:03,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-18 20:31:03,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670443149] [2022-04-18 20:31:03,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:31:03,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-18 20:31:03,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:31:03,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-18 20:31:03,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:31:03,930 INFO L87 Difference]: Start difference. First operand 27177 states and 111308 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:31:04,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:04,765 INFO L93 Difference]: Finished difference Result 27162 states and 111260 transitions. [2022-04-18 20:31:04,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-18 20:31:04,766 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:31:04,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:04,832 INFO L225 Difference]: With dead ends: 27162 [2022-04-18 20:31:04,832 INFO L226 Difference]: Without dead ends: 23728 [2022-04-18 20:31:04,832 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:31:04,832 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 175 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:04,833 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 57 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-18 20:31:04,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23728 states. [2022-04-18 20:31:05,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23728 to 23728. [2022-04-18 20:31:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23728 states, 23726 states have (on average 4.097277248588047) internal successors, (97212), 23727 states have internal predecessors, (97212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:31:05,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23728 states to 23728 states and 97212 transitions. [2022-04-18 20:31:05,413 INFO L78 Accepts]: Start accepts. Automaton has 23728 states and 97212 transitions. Word has length 47 [2022-04-18 20:31:05,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:05,413 INFO L478 AbstractCegarLoop]: Abstraction has 23728 states and 97212 transitions. [2022-04-18 20:31:05,413 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:31:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 23728 states and 97212 transitions. [2022-04-18 20:31:05,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-18 20:31:05,450 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:05,450 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 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:31:05,450 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-18 20:31:05,450 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-04-18 20:31:05,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:05,450 INFO L85 PathProgramCache]: Analyzing trace with hash 421191795, now seen corresponding path program 1 times [2022-04-18 20:31:05,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:31:05,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798616124] [2022-04-18 20:31:05,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:31:05,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:31:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:31:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-18 20:31:05,605 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:31:05,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798616124] [2022-04-18 20:31:05,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798616124] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:31:05,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837578801] [2022-04-18 20:31:05,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:31:05,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:31:05,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:31:05,607 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:31:05,607 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:31:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:31:05,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-18 20:31:05,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:06,242 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-18 20:31:06,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:31:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-18 20:31:06,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837578801] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:31:06,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1904222173] [2022-04-18 20:31:06,408 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:06,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:31:06,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2022-04-18 20:31:06,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329570957] [2022-04-18 20:31:06,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:31:06,409 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-18 20:31:06,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:31:06,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-18 20:31:06,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-04-18 20:31:06,410 INFO L87 Difference]: Start difference. First operand 23728 states and 97212 transitions. Second operand has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:31:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:31:07,264 INFO L93 Difference]: Finished difference Result 42856 states and 175850 transitions. [2022-04-18 20:31:07,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-18 20:31:07,265 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-04-18 20:31:07,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:31:07,395 INFO L225 Difference]: With dead ends: 42856 [2022-04-18 20:31:07,395 INFO L226 Difference]: Without dead ends: 42856 [2022-04-18 20:31:07,395 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2022-04-18 20:31:07,396 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 381 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-18 20:31:07,396 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 225 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-18 20:31:07,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42856 states. [2022-04-18 20:31:08,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42856 to 32373. [2022-04-18 20:31:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32373 states, 32371 states have (on average 4.10490871459022) internal successors, (132880), 32372 states have internal predecessors, (132880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:31:08,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32373 states to 32373 states and 132880 transitions. [2022-04-18 20:31:08,359 INFO L78 Accepts]: Start accepts. Automaton has 32373 states and 132880 transitions. Word has length 48 [2022-04-18 20:31:08,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:31:08,360 INFO L478 AbstractCegarLoop]: Abstraction has 32373 states and 132880 transitions. [2022-04-18 20:31:08,360 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:31:08,360 INFO L276 IsEmpty]: Start isEmpty. Operand 32373 states and 132880 transitions. [2022-04-18 20:31:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-18 20:31:08,420 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:31:08,420 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:31:08,439 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:31:08,628 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,SelfDestructingSolverStorable23 [2022-04-18 20:31:08,628 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:31:08,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:31:08,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1951633905, now seen corresponding path program 2 times [2022-04-18 20:31:08,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:31:08,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279410400] [2022-04-18 20:31:08,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:31:08,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:31:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:31:08,914 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-18 20:31:08,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:31:08,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279410400] [2022-04-18 20:31:08,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279410400] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:31:08,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237479323] [2022-04-18 20:31:08,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:31:08,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:31:08,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:31:08,915 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:31:08,916 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:31:09,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-18 20:31:09,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:31:09,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-18 20:31:09,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:31:09,397 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:31:09,397 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:09,437 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:31:09,437 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:09,494 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:31:09,498 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:09,789 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:09,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:31:09,834 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 56 [2022-04-18 20:31:09,912 INFO L356 Elim1Store]: treesize reduction 502, result has 8.6 percent of original size [2022-04-18 20:31:09,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 62 [2022-04-18 20:31:10,057 INFO L356 Elim1Store]: treesize reduction 371, result has 13.7 percent of original size [2022-04-18 20:31:10,057 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:31:12,211 INFO L356 Elim1Store]: treesize reduction 500, result has 12.4 percent of original size [2022-04-18 20:31:12,211 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:31:14,372 INFO L356 Elim1Store]: treesize reduction 647, result has 11.4 percent of original size [2022-04-18 20:31:14,372 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:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-18 20:31:16,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:31:16,723 WARN L833 $PredicateComparison]: unable to prove that (forall ((|thread2Thread1of1ForFork0_~i~1#1| Int)) (or (forall ((v_ArrVal_7503 (Array Int Int)) (v_ArrVal_7502 (Array Int Int)) (v_ArrVal_7508 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_7502) c_~B~0.base (let ((.cse0 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base v_ArrVal_7503) 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_7508) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0))) is different from false [2022-04-18 20:31:16,734 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:31:16,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 69 [2022-04-18 20:31:16,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 119 [2022-04-18 20:31:16,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:31:16,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:31:16,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:31:16,745 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 89 treesize of output 83 [2022-04-18 20:31:16,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:31:16,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:31:16,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:31:16,753 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 71 treesize of output 59 [2022-04-18 20:31:16,759 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:31:17,137 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 2 not checked. [2022-04-18 20:31:17,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237479323] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:31:17,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1544303332] [2022-04-18 20:31:17,138 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:17,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:31:17,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 26 [2022-04-18 20:31:17,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904721527] [2022-04-18 20:31:17,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:31:17,138 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-18 20:31:17,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:31:17,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-18 20:31:17,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=580, Unknown=1, NotChecked=50, Total=756 [2022-04-18 20:31:17,139 INFO L87 Difference]: Start difference. First operand 32373 states and 132880 transitions. Second operand has 28 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 27 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:32:06,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:32:06,740 INFO L93 Difference]: Finished difference Result 38327 states and 158195 transitions. [2022-04-18 20:32:06,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-18 20:32:06,740 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 27 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 50 [2022-04-18 20:32:06,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:32:06,853 INFO L225 Difference]: With dead ends: 38327 [2022-04-18 20:32:06,853 INFO L226 Difference]: Without dead ends: 38142 [2022-04-18 20:32:06,853 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 54.6s TimeCoverageRelationStatistics Valid=378, Invalid=1009, Unknown=23, NotChecked=72, Total=1482 [2022-04-18 20:32:06,854 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 373 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 660 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-18 20:32:06,854 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 211 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 648 Invalid, 0 Unknown, 660 Unchecked, 1.3s Time] [2022-04-18 20:32:06,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38142 states. [2022-04-18 20:32:07,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38142 to 8649. [2022-04-18 20:32:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8649 states, 8648 states have (on average 4.02763644773358) internal successors, (34831), 8648 states have internal predecessors, (34831), 0 states have call successors, (0), 0 states have call 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:07,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8649 states to 8649 states and 34831 transitions. [2022-04-18 20:32:07,307 INFO L78 Accepts]: Start accepts. Automaton has 8649 states and 34831 transitions. Word has length 50 [2022-04-18 20:32:07,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:32:07,307 INFO L478 AbstractCegarLoop]: Abstraction has 8649 states and 34831 transitions. [2022-04-18 20:32:07,307 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 27 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:32:07,307 INFO L276 IsEmpty]: Start isEmpty. Operand 8649 states and 34831 transitions. [2022-04-18 20:32:07,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-18 20:32:07,321 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:32:07,321 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:32:07,341 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:32:07,521 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:32:07,521 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:32:07,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:32:07,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1950168225, now seen corresponding path program 3 times [2022-04-18 20:32:07,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:32:07,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937171278] [2022-04-18 20:32:07,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:32:07,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:32:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:32:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-18 20:32:07,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:32:07,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937171278] [2022-04-18 20:32:07,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937171278] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:32:07,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788046713] [2022-04-18 20:32:07,802 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:32:07,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:32:07,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:32:07,804 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:32:07,804 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:32:08,243 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:32:08,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:32:08,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 83 conjunts are in the unsatisfiable core [2022-04-18 20:32:08,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:32:08,315 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-04-18 20:32:08,315 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:32:08,350 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:32:08,350 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:32:08,406 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-18 20:32:08,406 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:32:08,679 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:32:08,726 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 93 treesize of output 122 [2022-04-18 20:32:08,835 INFO L356 Elim1Store]: treesize reduction 271, result has 10.0 percent of original size [2022-04-18 20:32:08,836 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 356 treesize of output 147 [2022-04-18 20:32:09,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:09,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:32:09,196 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 62 treesize of output 57 [2022-04-18 20:32:09,284 INFO L356 Elim1Store]: treesize reduction 820, result has 6.7 percent of original size [2022-04-18 20:32:09,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 74 [2022-04-18 20:32:09,291 INFO L356 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-04-18 20:32:09,291 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:32:11,439 INFO L356 Elim1Store]: treesize reduction 500, result has 12.4 percent of original size [2022-04-18 20:32:11,440 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:32:19,715 INFO L356 Elim1Store]: treesize reduction 647, result has 11.4 percent of original size [2022-04-18 20:32:19,715 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:32:19,754 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-18 20:32:19,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:32:19,918 WARN L833 $PredicateComparison]: unable to prove that (forall ((~A~0.offset Int) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (or (forall ((v_ArrVal_8057 (Array Int Int)) (v_ArrVal_8072 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_8072) 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_8057) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0))) is different from false [2022-04-18 20:32:20,010 INFO L356 Elim1Store]: treesize reduction 584, result has 11.5 percent of original size [2022-04-18 20:32:20,011 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 6 case distinctions, treesize of input 125 treesize of output 143 [2022-04-18 20:32:20,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 175 [2022-04-18 20:32:20,026 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:32:20,095 INFO L356 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-04-18 20:32:20,095 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 44 treesize of output 17 [2022-04-18 20:32:20,173 INFO L356 Elim1Store]: treesize reduction 105, result has 39.3 percent of original size [2022-04-18 20:32:20,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 210 treesize of output 232 [2022-04-18 20:32:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 2 not checked. [2022-04-18 20:32:20,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788046713] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:32:20,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [745384565] [2022-04-18 20:32:20,592 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:32:20,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:32:20,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 27 [2022-04-18 20:32:20,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701437798] [2022-04-18 20:32:20,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:32:20,592 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-18 20:32:20,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:32:20,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-18 20:32:20,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=580, Unknown=6, NotChecked=50, Total=756 [2022-04-18 20:32:20,593 INFO L87 Difference]: Start difference. First operand 8649 states and 34831 transitions. Second operand has 28 states, 27 states have (on average 4.2592592592592595) internal successors, (115), 28 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call 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:22,319 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) (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|)) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (< c_thread1Thread1of1ForFork2_~i~0 c_~N~0) (= (select |c_#valid| c_~A~0.base) 1) (forall ((~A~0.offset Int) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (or (forall ((v_ArrVal_8057 (Array Int Int)) (v_ArrVal_8072 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_8072) 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_8057) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0)))) is different from false [2022-04-18 20:32:56,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:32:56,953 INFO L93 Difference]: Finished difference Result 19736 states and 80651 transitions. [2022-04-18 20:32:56,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-18 20:32:56,954 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.2592592592592595) internal successors, (115), 28 states have internal predecessors, (115), 0 states have call successors, (0), 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 50 [2022-04-18 20:32:56,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:32:57,011 INFO L225 Difference]: With dead ends: 19736 [2022-04-18 20:32:57,011 INFO L226 Difference]: Without dead ends: 19629 [2022-04-18 20:32:57,012 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 91 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 44.3s TimeCoverageRelationStatistics Valid=459, Invalid=1560, Unknown=59, NotChecked=178, Total=2256 [2022-04-18 20:32:57,012 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 647 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 2757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1389 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-18 20:32:57,012 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [647 Valid, 465 Invalid, 2757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1197 Invalid, 0 Unknown, 1389 Unchecked, 2.5s Time] [2022-04-18 20:32:57,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19629 states. [2022-04-18 20:32:57,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19629 to 14290. [2022-04-18 20:32:57,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14290 states, 14289 states have (on average 4.06711456365036) internal successors, (58115), 14289 states have internal predecessors, (58115), 0 states have call successors, (0), 0 states have call 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:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14290 states to 14290 states and 58115 transitions. [2022-04-18 20:32:57,361 INFO L78 Accepts]: Start accepts. Automaton has 14290 states and 58115 transitions. Word has length 50 [2022-04-18 20:32:57,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:32:57,361 INFO L478 AbstractCegarLoop]: Abstraction has 14290 states and 58115 transitions. [2022-04-18 20:32:57,362 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.2592592592592595) internal successors, (115), 28 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call 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:57,362 INFO L276 IsEmpty]: Start isEmpty. Operand 14290 states and 58115 transitions. [2022-04-18 20:32:57,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-18 20:32:57,389 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:32:57,389 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:32:57,407 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:32:57,589 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:32:57,589 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:32:57,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:32:57,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1902887025, now seen corresponding path program 4 times [2022-04-18 20:32:57,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:32:57,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279188684] [2022-04-18 20:32:57,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:32:57,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:32:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:32:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-18 20:32:58,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:32:58,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279188684] [2022-04-18 20:32:58,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279188684] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 20:32:58,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564757438] [2022-04-18 20:32:58,009 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-18 20:32:58,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:32:58,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:32:58,010 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:32:58,011 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:32:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:32:58,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 79 conjunts are in the unsatisfiable core [2022-04-18 20:32:58,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:32:58,459 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-04-18 20:32:58,523 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 20:32:58,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-04-18 20:32:59,168 INFO L356 Elim1Store]: treesize reduction 1381, result has 6.9 percent of original size [2022-04-18 20:32:59,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 81 treesize of output 117 [2022-04-18 20:32:59,191 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-04-18 20:32:59,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 107 [2022-04-18 20:33:00,041 INFO L356 Elim1Store]: treesize reduction 141, result has 11.9 percent of original size [2022-04-18 20:33:00,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 40 [2022-04-18 20:33:00,195 INFO L356 Elim1Store]: treesize reduction 141, result has 11.9 percent of original size [2022-04-18 20:33:00,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 40 [2022-04-18 20:33:00,267 INFO L356 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2022-04-18 20:33:00,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 49 [2022-04-18 20:33:00,312 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-18 20:33:00,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:33:00,776 INFO L356 Elim1Store]: treesize reduction 2193, result has 6.4 percent of original size [2022-04-18 20:33:00,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 122 treesize of output 163 [2022-04-18 20:33:00,914 INFO L356 Elim1Store]: treesize reduction 440, result has 17.3 percent of original size [2022-04-18 20:33:00,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 165 treesize of output 187 [2022-04-18 20:33:00,935 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:33:01,371 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-18 20:33:01,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564757438] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:33:01,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [987069186] [2022-04-18 20:33:01,372 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:33:01,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 20:33:01,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 24 [2022-04-18 20:33:01,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165048616] [2022-04-18 20:33:01,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 20:33:01,372 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-18 20:33:01,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:33:01,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-18 20:33:01,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-04-18 20:33:01,373 INFO L87 Difference]: Start difference. First operand 14290 states and 58115 transitions. Second operand has 25 states, 24 states have (on average 4.541666666666667) internal successors, (109), 25 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:33:09,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:33:09,125 INFO L93 Difference]: Finished difference Result 58431 states and 239099 transitions. [2022-04-18 20:33:09,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-18 20:33:09,126 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.541666666666667) internal successors, (109), 25 states have internal predecessors, (109), 0 states have call successors, (0), 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 50 [2022-04-18 20:33:09,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:33:09,126 INFO L225 Difference]: With dead ends: 58431 [2022-04-18 20:33:09,126 INFO L226 Difference]: Without dead ends: 0 [2022-04-18 20:33:09,127 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 86 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1317 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1044, Invalid=3648, Unknown=0, NotChecked=0, Total=4692 [2022-04-18 20:33:09,127 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 1058 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 3094 mSolverCounterSat, 726 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 3820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 726 IncrementalHoareTripleChecker+Valid, 3094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:33:09,127 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1058 Valid, 642 Invalid, 3820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [726 Valid, 3094 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-04-18 20:33:09,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-18 20:33:09,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-18 20:33:09,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:33:09,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-18 20:33:09,128 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2022-04-18 20:33:09,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:33:09,128 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-18 20:33:09,128 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.541666666666667) internal successors, (109), 25 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 20:33:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-18 20:33:09,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-18 20:33:09,130 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (89 of 90 remaining) [2022-04-18 20:33:09,131 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (88 of 90 remaining) [2022-04-18 20:33:09,131 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (87 of 90 remaining) [2022-04-18 20:33:09,131 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (86 of 90 remaining) [2022-04-18 20:33:09,132 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (85 of 90 remaining) [2022-04-18 20:33:09,132 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (84 of 90 remaining) [2022-04-18 20:33:09,132 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (83 of 90 remaining) [2022-04-18 20:33:09,132 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (82 of 90 remaining) [2022-04-18 20:33:09,132 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (81 of 90 remaining) [2022-04-18 20:33:09,132 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (80 of 90 remaining) [2022-04-18 20:33:09,132 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (79 of 90 remaining) [2022-04-18 20:33:09,132 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (78 of 90 remaining) [2022-04-18 20:33:09,132 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (77 of 90 remaining) [2022-04-18 20:33:09,132 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (76 of 90 remaining) [2022-04-18 20:33:09,132 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (75 of 90 remaining) [2022-04-18 20:33:09,132 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (74 of 90 remaining) [2022-04-18 20:33:09,132 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (73 of 90 remaining) [2022-04-18 20:33:09,133 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (72 of 90 remaining) [2022-04-18 20:33:09,133 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (71 of 90 remaining) [2022-04-18 20:33:09,133 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (70 of 90 remaining) [2022-04-18 20:33:09,133 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (69 of 90 remaining) [2022-04-18 20:33:09,133 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (68 of 90 remaining) [2022-04-18 20:33:09,133 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (67 of 90 remaining) [2022-04-18 20:33:09,133 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (66 of 90 remaining) [2022-04-18 20:33:09,133 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (65 of 90 remaining) [2022-04-18 20:33:09,133 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (64 of 90 remaining) [2022-04-18 20:33:09,133 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (63 of 90 remaining) [2022-04-18 20:33:09,133 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (62 of 90 remaining) [2022-04-18 20:33:09,133 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (61 of 90 remaining) [2022-04-18 20:33:09,133 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (60 of 90 remaining) [2022-04-18 20:33:09,133 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (59 of 90 remaining) [2022-04-18 20:33:09,133 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (58 of 90 remaining) [2022-04-18 20:33:09,133 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (57 of 90 remaining) [2022-04-18 20:33:09,134 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (56 of 90 remaining) [2022-04-18 20:33:09,134 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (55 of 90 remaining) [2022-04-18 20:33:09,134 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (54 of 90 remaining) [2022-04-18 20:33:09,134 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (53 of 90 remaining) [2022-04-18 20:33:09,134 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (52 of 90 remaining) [2022-04-18 20:33:09,134 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (51 of 90 remaining) [2022-04-18 20:33:09,134 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (50 of 90 remaining) [2022-04-18 20:33:09,134 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (49 of 90 remaining) [2022-04-18 20:33:09,134 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (48 of 90 remaining) [2022-04-18 20:33:09,134 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (47 of 90 remaining) [2022-04-18 20:33:09,134 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (46 of 90 remaining) [2022-04-18 20:33:09,134 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (45 of 90 remaining) [2022-04-18 20:33:09,134 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (44 of 90 remaining) [2022-04-18 20:33:09,134 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (43 of 90 remaining) [2022-04-18 20:33:09,134 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (42 of 90 remaining) [2022-04-18 20:33:09,134 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (41 of 90 remaining) [2022-04-18 20:33:09,134 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (40 of 90 remaining) [2022-04-18 20:33:09,134 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (39 of 90 remaining) [2022-04-18 20:33:09,135 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (38 of 90 remaining) [2022-04-18 20:33:09,135 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (37 of 90 remaining) [2022-04-18 20:33:09,135 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (36 of 90 remaining) [2022-04-18 20:33:09,135 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (35 of 90 remaining) [2022-04-18 20:33:09,135 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (34 of 90 remaining) [2022-04-18 20:33:09,135 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (33 of 90 remaining) [2022-04-18 20:33:09,135 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (32 of 90 remaining) [2022-04-18 20:33:09,135 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 90 remaining) [2022-04-18 20:33:09,135 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 90 remaining) [2022-04-18 20:33:09,135 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 90 remaining) [2022-04-18 20:33:09,135 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 90 remaining) [2022-04-18 20:33:09,135 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (27 of 90 remaining) [2022-04-18 20:33:09,135 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 90 remaining) [2022-04-18 20:33:09,136 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (25 of 90 remaining) [2022-04-18 20:33:09,136 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (24 of 90 remaining) [2022-04-18 20:33:09,136 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 90 remaining) [2022-04-18 20:33:09,136 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 90 remaining) [2022-04-18 20:33:09,136 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (21 of 90 remaining) [2022-04-18 20:33:09,136 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (20 of 90 remaining) [2022-04-18 20:33:09,136 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 90 remaining) [2022-04-18 20:33:09,136 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (18 of 90 remaining) [2022-04-18 20:33:09,136 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (17 of 90 remaining) [2022-04-18 20:33:09,136 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (16 of 90 remaining) [2022-04-18 20:33:09,136 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (15 of 90 remaining) [2022-04-18 20:33:09,137 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (14 of 90 remaining) [2022-04-18 20:33:09,137 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (13 of 90 remaining) [2022-04-18 20:33:09,137 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (12 of 90 remaining) [2022-04-18 20:33:09,137 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (11 of 90 remaining) [2022-04-18 20:33:09,137 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (10 of 90 remaining) [2022-04-18 20:33:09,137 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (9 of 90 remaining) [2022-04-18 20:33:09,137 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (8 of 90 remaining) [2022-04-18 20:33:09,137 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (7 of 90 remaining) [2022-04-18 20:33:09,137 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (6 of 90 remaining) [2022-04-18 20:33:09,137 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (5 of 90 remaining) [2022-04-18 20:33:09,137 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (4 of 90 remaining) [2022-04-18 20:33:09,137 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 90 remaining) [2022-04-18 20:33:09,137 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 90 remaining) [2022-04-18 20:33:09,137 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 90 remaining) [2022-04-18 20:33:09,137 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 90 remaining) [2022-04-18 20:33:09,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-18 20:33:09,339 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-18 20:33:09,341 INFO L719 BasicCegarLoop]: Path program histogram: [5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:33:09,343 INFO L227 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-04-18 20:33:09,343 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-18 20:33:09,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 08:33:09 BasicIcfg [2022-04-18 20:33:09,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-18 20:33:09,345 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-04-18 20:33:09,345 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-04-18 20:33:09,346 INFO L275 PluginConnector]: Witness Printer initialized [2022-04-18 20:33:09,346 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 08:22:38" (3/4) ... [2022-04-18 20:33:09,347 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-04-18 20:33:09,352 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-04-18 20:33:09,352 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-04-18 20:33:09,352 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-04-18 20:33:09,357 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2022-04-18 20:33:09,358 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-04-18 20:33:09,358 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-04-18 20:33:09,358 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-04-18 20:33:09,389 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/witness.graphml [2022-04-18 20:33:09,389 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-04-18 20:33:09,389 INFO L158 Benchmark]: Toolchain (without parser) took 632435.01ms. Allocated memory was 111.1MB in the beginning and 8.9GB in the end (delta: 8.7GB). Free memory was 77.9MB in the beginning and 6.3GB in the end (delta: -6.2GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2022-04-18 20:33:09,389 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 81.8MB. Free memory was 38.5MB in the beginning and 38.5MB in the end (delta: 40.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 20:33:09,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.54ms. Allocated memory is still 111.1MB. Free memory was 77.9MB in the beginning and 83.6MB in the end (delta: -5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-04-18 20:33:09,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.64ms. Allocated memory is still 111.1MB. Free memory was 83.6MB in the beginning and 80.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-04-18 20:33:09,390 INFO L158 Benchmark]: Boogie Preprocessor took 45.60ms. Allocated memory is still 111.1MB. Free memory was 80.2MB in the beginning and 76.6MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 20:33:09,390 INFO L158 Benchmark]: RCFGBuilder took 814.61ms. Allocated memory is still 111.1MB. Free memory was 76.6MB in the beginning and 50.2MB in the end (delta: 26.3MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2022-04-18 20:33:09,390 INFO L158 Benchmark]: TraceAbstraction took 631259.76ms. Allocated memory was 111.1MB in the beginning and 8.9GB in the end (delta: 8.7GB). Free memory was 49.7MB in the beginning and 6.3GB in the end (delta: -6.2GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2022-04-18 20:33:09,390 INFO L158 Benchmark]: Witness Printer took 43.70ms. Allocated memory is still 8.9GB. Free memory was 6.3GB in the beginning and 6.3GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-04-18 20:33:09,391 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 81.8MB. Free memory was 38.5MB in the beginning and 38.5MB in the end (delta: 40.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.54ms. Allocated memory is still 111.1MB. Free memory was 77.9MB in the beginning and 83.6MB in the end (delta: -5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.64ms. Allocated memory is still 111.1MB. Free memory was 83.6MB in the beginning and 80.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.60ms. Allocated memory is still 111.1MB. Free memory was 80.2MB in the beginning and 76.6MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 814.61ms. Allocated memory is still 111.1MB. Free memory was 76.6MB in the beginning and 50.2MB in the end (delta: 26.3MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * TraceAbstraction took 631259.76ms. Allocated memory was 111.1MB in the beginning and 8.9GB in the end (delta: 8.7GB). Free memory was 49.7MB in the beginning and 6.3GB in the end (delta: -6.2GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 43.70ms. Allocated memory is still 8.9GB. Free memory was 6.3GB in the beginning and 6.3GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 243.2s, 511 PlacesBefore, 130 PlacesAfterwards, 528 TransitionsBefore, 132 TransitionsAfterwards, 13362 CoEnabledTransitionPairs, 15 FixpointIterations, 426 TrivialSequentialCompositions, 157 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 12 ConcurrentYvCompositions, 15 ChoiceCompositions, 654 TotalNumberOfCompositions, 93489 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29148, positive: 27538, positive conditional: 0, positive unconditional: 27538, negative: 1610, negative conditional: 0, negative unconditional: 1610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11188, positive: 10870, positive conditional: 0, positive unconditional: 10870, negative: 318, negative conditional: 0, negative unconditional: 318, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11188, positive: 9135, positive conditional: 0, positive unconditional: 9135, negative: 2053, negative conditional: 0, negative unconditional: 2053, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2053, positive: 1735, positive conditional: 0, positive unconditional: 1735, negative: 232, negative conditional: 0, negative unconditional: 232, unknown: 86, unknown conditional: 0, unknown unconditional: 86] , SemanticIndependenceRelation.Query Time [ms]: [ total: 200940, positive: 3165, positive conditional: 0, positive unconditional: 3165, negative: 14164, negative conditional: 0, negative unconditional: 14164, unknown: 183611, unknown conditional: 0, unknown unconditional: 183611] ], Cache Queries: [ total: 29148, positive: 16668, positive conditional: 0, positive unconditional: 16668, negative: 1292, negative conditional: 0, negative unconditional: 1292, unknown: 11188, unknown conditional: 0, unknown unconditional: 11188] , Statistics on independence cache: Total cache size (in pairs): 2419, Positive cache size: 2329, Positive conditional cache size: 0, Positive unconditional cache size: 2329, Negative cache size: 90, Negative conditional cache size: 0, Negative unconditional cache size: 90 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 622 locations, 90 error locations. Started 1 CEGAR loops. OverallTime: 631.1s, OverallIterations: 27, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.7s, AutomataDifference: 302.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 244.7s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10883 SdHoareTripleChecker+Valid, 54.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10883 mSDsluCounter, 8800 SdHoareTripleChecker+Invalid, 49.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 15806 IncrementalHoareTripleChecker+Unchecked, 17586 mSDsCounter, 3606 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26583 IncrementalHoareTripleChecker+Invalid, 45995 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3606 mSolverCounterUnsat, 1506 mSDtfsCounter, 26583 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1985 GetRequests, 1169 SyntacticMatches, 62 SemanticMatches, 754 ConstructedPredicates, 21 IntricatePredicates, 8 DeprecatedPredicates, 11611 ImplicationChecksByTransitivity, 272.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107323occurred in iteration=21, InterpolantAutomatonStates: 546, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 361914 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 58.4s InterpolantComputationTime, 1497 NumberOfCodeBlocks, 1415 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2061 ConstructedInterpolants, 69 QuantifiedInterpolants, 27930 SizeOfPredicates, 133 NumberOfNonLiveVariables, 10307 ConjunctsInSsa, 841 ConjunctsInUnsatCore, 57 InterpolantComputations, 13 PerfectInterpolantSequences, 854/1196 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 58 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-18 20:33:09,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE