./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 306d85d0b5300749928a8392783cd7ec5acf0c4622b6bdba80c3589786dd98ad --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 08:10:47,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:10:47,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:10:47,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:10:47,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:10:47,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:10:47,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:10:47,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:10:47,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:10:47,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:10:47,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:10:47,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:10:47,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:10:47,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:10:47,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:10:47,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:10:47,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:10:47,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:10:47,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:10:47,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:10:47,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:10:47,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:10:47,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:10:47,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:10:47,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:10:47,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:10:47,139 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:10:47,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:10:47,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:10:47,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:10:47,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:10:47,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:10:47,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:10:47,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:10:47,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:10:47,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:10:47,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:10:47,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:10:47,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:10:47,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:10:47,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:10:47,156 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-19 08:10:47,197 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:10:47,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:10:47,202 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:10:47,202 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:10:47,203 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:10:47,204 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:10:47,204 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:10:47,204 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:10:47,204 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:10:47,205 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 08:10:47,206 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:10:47,206 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:10:47,206 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 08:10:47,207 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 08:10:47,207 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:10:47,207 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 08:10:47,207 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 08:10:47,208 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 08:10:47,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:10:47,209 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:10:47,209 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:10:47,209 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:10:47,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:10:47,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:10:47,212 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 08:10:47,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:10:47,212 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 08:10:47,212 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-19 08:10:47,213 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:10:47,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 08:10:47,213 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:10:47,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 08:10:47,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:10:47,214 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:10:47,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:10:47,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:10:47,215 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 08:10:47,215 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:10:47,215 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 08:10:47,215 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 08:10:47,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 08:10:47,216 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 08:10:47,216 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:10:47,216 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 306d85d0b5300749928a8392783cd7ec5acf0c4622b6bdba80c3589786dd98ad [2022-11-19 08:10:47,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:10:47,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:10:47,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:10:47,613 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:10:47,615 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:10:47,616 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2022-11-19 08:10:47,688 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/data/79eaa5f65/746e2d358c0a4112a09e01e6dea6c247/FLAG709e6a7fc [2022-11-19 08:10:48,261 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:10:48,263 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2022-11-19 08:10:48,278 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/data/79eaa5f65/746e2d358c0a4112a09e01e6dea6c247/FLAG709e6a7fc [2022-11-19 08:10:48,576 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/data/79eaa5f65/746e2d358c0a4112a09e01e6dea6c247 [2022-11-19 08:10:48,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:10:48,580 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:10:48,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:10:48,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:10:48,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:10:48,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:10:48" (1/1) ... [2022-11-19 08:10:48,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5292f576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:48, skipping insertion in model container [2022-11-19 08:10:48,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:10:48" (1/1) ... [2022-11-19 08:10:48,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:10:48,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:10:48,902 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c[2823,2836] [2022-11-19 08:10:48,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:10:48,940 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:10:48,995 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c[2823,2836] [2022-11-19 08:10:49,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:10:49,016 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:10:49,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:49 WrapperNode [2022-11-19 08:10:49,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:10:49,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:10:49,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:10:49,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:10:49,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:49" (1/1) ... [2022-11-19 08:10:49,043 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:49" (1/1) ... [2022-11-19 08:10:49,088 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 371 [2022-11-19 08:10:49,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:10:49,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:10:49,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:10:49,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:10:49,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:49" (1/1) ... [2022-11-19 08:10:49,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:49" (1/1) ... [2022-11-19 08:10:49,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:49" (1/1) ... [2022-11-19 08:10:49,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:49" (1/1) ... [2022-11-19 08:10:49,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:49" (1/1) ... [2022-11-19 08:10:49,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:49" (1/1) ... [2022-11-19 08:10:49,141 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:49" (1/1) ... [2022-11-19 08:10:49,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:49" (1/1) ... [2022-11-19 08:10:49,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:10:49,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:10:49,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:10:49,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:10:49,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:49" (1/1) ... [2022-11-19 08:10:49,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:10:49,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:10:49,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:10:49,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:10:49,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:10:49,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 08:10:49,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 08:10:49,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 08:10:49,261 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-19 08:10:49,261 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-19 08:10:49,262 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-19 08:10:49,262 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-19 08:10:49,262 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-19 08:10:49,262 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-19 08:10:49,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 08:10:49,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 08:10:49,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 08:10:49,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 08:10:49,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:10:49,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:10:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:10:49,265 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 08:10:49,460 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:10:49,462 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:10:50,392 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:10:50,622 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:10:50,622 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-19 08:10:50,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:10:50 BoogieIcfgContainer [2022-11-19 08:10:50,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:10:50,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:10:50,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:10:50,632 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:10:50,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:10:48" (1/3) ... [2022-11-19 08:10:50,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364f49e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:10:50, skipping insertion in model container [2022-11-19 08:10:50,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:49" (2/3) ... [2022-11-19 08:10:50,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364f49e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:10:50, skipping insertion in model container [2022-11-19 08:10:50,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:10:50" (3/3) ... [2022-11-19 08:10:50,636 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2022-11-19 08:10:50,646 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-19 08:10:50,657 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:10:50,657 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2022-11-19 08:10:50,657 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 08:10:50,833 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-19 08:10:50,916 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 08:10:50,941 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 511 places, 528 transitions, 1080 flow [2022-11-19 08:10:50,947 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 511 places, 528 transitions, 1080 flow [2022-11-19 08:10:50,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 511 places, 528 transitions, 1080 flow [2022-11-19 08:10:51,260 INFO L130 PetriNetUnfolder]: 27/525 cut-off events. [2022-11-19 08:10:51,261 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-19 08:10:51,275 INFO L83 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 624 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-11-19 08:10:51,286 INFO L119 LiptonReduction]: Number of co-enabled transitions 13362 [2022-11-19 08:13:27,403 INFO L134 LiptonReduction]: Checked pairs total: 94407 [2022-11-19 08:13:27,403 INFO L136 LiptonReduction]: Total number of compositions: 633 [2022-11-19 08:13:27,413 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 130 places, 132 transitions, 288 flow [2022-11-19 08:13:30,368 INFO L135 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-11-19 08:13:30,409 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:13:30,424 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@692329f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:13:30,424 INFO L358 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2022-11-19 08:13:30,684 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-11-19 08:13:30,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 08:13:30,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:30,692 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 08:13:30,694 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:13:30,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:30,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2167, now seen corresponding path program 1 times [2022-11-19 08:13:30,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:13:30,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863381149] [2022-11-19 08:13:30,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:30,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:13:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:13:30,836 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:13:30,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863381149] [2022-11-19 08:13:30,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863381149] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:30,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:30,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 08:13:30,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021808500] [2022-11-19 08:13:30,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:30,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 08:13:30,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:13:30,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 08:13:30,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 08:13:30,963 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-11-19 08:13:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:31,401 INFO L93 Difference]: Finished difference Result 5616 states and 22643 transitions. [2022-11-19 08:13:31,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 08:13:31,403 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-11-19 08:13:31,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:31,468 INFO L225 Difference]: With dead ends: 5616 [2022-11-19 08:13:31,469 INFO L226 Difference]: Without dead ends: 5585 [2022-11-19 08:13:31,469 INFO L412 NwaCegarLoop]: 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-11-19 08:13:31,473 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:31,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:13:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5585 states. [2022-11-19 08:13:31,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5585 to 5585. [2022-11-19 08:13:31,852 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-11-19 08:13:31,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5585 states to 5585 states and 22556 transitions. [2022-11-19 08:13:31,917 INFO L78 Accepts]: Start accepts. Automaton has 5585 states and 22556 transitions. Word has length 1 [2022-11-19 08:13:31,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:31,918 INFO L495 AbstractCegarLoop]: Abstraction has 5585 states and 22556 transitions. [2022-11-19 08:13:31,924 INFO L496 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-11-19 08:13:31,926 INFO L276 IsEmpty]: Start isEmpty. Operand 5585 states and 22556 transitions. [2022-11-19 08:13:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 08:13:31,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:31,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:13:31,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 08:13:31,930 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:13:31,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:31,932 INFO L85 PathProgramCache]: Analyzing trace with hash -315166111, now seen corresponding path program 1 times [2022-11-19 08:13:31,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:13:31,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602823507] [2022-11-19 08:13:31,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:31,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:13:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:13:32,649 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:13:32,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602823507] [2022-11-19 08:13:32,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602823507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:32,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:32,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:13:32,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970057521] [2022-11-19 08:13:32,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:32,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:13:32,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:13:32,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:13:32,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:13:32,658 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-11-19 08:13:33,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:33,131 INFO L93 Difference]: Finished difference Result 5586 states and 22557 transitions. [2022-11-19 08:13:33,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:13:33,132 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-11-19 08:13:33,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:33,188 INFO L225 Difference]: With dead ends: 5586 [2022-11-19 08:13:33,188 INFO L226 Difference]: Without dead ends: 5586 [2022-11-19 08:13:33,189 INFO L412 NwaCegarLoop]: 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-11-19 08:13:33,191 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:33,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 08:13:33,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5586 states. [2022-11-19 08:13:33,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5586 to 5586. [2022-11-19 08:13:33,573 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-11-19 08:13:33,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5586 states to 5586 states and 22557 transitions. [2022-11-19 08:13:33,679 INFO L78 Accepts]: Start accepts. Automaton has 5586 states and 22557 transitions. Word has length 13 [2022-11-19 08:13:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:33,679 INFO L495 AbstractCegarLoop]: Abstraction has 5586 states and 22557 transitions. [2022-11-19 08:13:33,680 INFO L496 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-11-19 08:13:33,680 INFO L276 IsEmpty]: Start isEmpty. Operand 5586 states and 22557 transitions. [2022-11-19 08:13:33,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:13:33,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:33,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:13:33,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 08:13:33,682 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:13:33,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:33,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1540683272, now seen corresponding path program 1 times [2022-11-19 08:13:33,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:13:33,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510519411] [2022-11-19 08:13:33,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:33,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:13:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:34,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 08:13:34,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:13:34,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510519411] [2022-11-19 08:13:34,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510519411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:34,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:34,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:13:34,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633472761] [2022-11-19 08:13:34,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:34,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:13:34,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:13:34,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:13:34,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:13:34,959 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-11-19 08:13:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:38,028 INFO L93 Difference]: Finished difference Result 9026 states and 36659 transitions. [2022-11-19 08:13:38,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:13:38,029 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-11-19 08:13:38,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:38,120 INFO L225 Difference]: With dead ends: 9026 [2022-11-19 08:13:38,120 INFO L226 Difference]: Without dead ends: 9026 [2022-11-19 08:13:38,123 INFO L412 NwaCegarLoop]: 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-11-19 08:13:38,127 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 80 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:38,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 71 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-19 08:13:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9026 states. [2022-11-19 08:13:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9026 to 6506. [2022-11-19 08:13:38,456 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-11-19 08:13:38,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 26393 transitions. [2022-11-19 08:13:38,501 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 26393 transitions. Word has length 14 [2022-11-19 08:13:38,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:38,502 INFO L495 AbstractCegarLoop]: Abstraction has 6506 states and 26393 transitions. [2022-11-19 08:13:38,502 INFO L496 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-11-19 08:13:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 26393 transitions. [2022-11-19 08:13:38,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 08:13:38,504 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:38,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:13:38,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 08:13:38,505 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:13:38,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:38,506 INFO L85 PathProgramCache]: Analyzing trace with hash 516557318, now seen corresponding path program 1 times [2022-11-19 08:13:38,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:13:38,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401096091] [2022-11-19 08:13:38,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:38,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:13:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 08:13:38,605 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:13:38,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401096091] [2022-11-19 08:13:38,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401096091] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:38,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:38,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:13:38,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311108969] [2022-11-19 08:13:38,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:38,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:13:38,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:13:38,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:13:38,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:13:38,609 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-11-19 08:13:39,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:39,208 INFO L93 Difference]: Finished difference Result 10116 states and 41047 transitions. [2022-11-19 08:13:39,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:13:39,209 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-11-19 08:13:39,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:39,308 INFO L225 Difference]: With dead ends: 10116 [2022-11-19 08:13:39,308 INFO L226 Difference]: Without dead ends: 10116 [2022-11-19 08:13:39,309 INFO L412 NwaCegarLoop]: 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-11-19 08:13:39,312 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 57 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:39,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 90 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 08:13:39,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10116 states. [2022-11-19 08:13:39,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10116 to 6336. [2022-11-19 08:13:39,682 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-11-19 08:13:39,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6336 states to 6336 states and 25713 transitions. [2022-11-19 08:13:39,739 INFO L78 Accepts]: Start accepts. Automaton has 6336 states and 25713 transitions. Word has length 15 [2022-11-19 08:13:39,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:39,741 INFO L495 AbstractCegarLoop]: Abstraction has 6336 states and 25713 transitions. [2022-11-19 08:13:39,742 INFO L496 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-11-19 08:13:39,742 INFO L276 IsEmpty]: Start isEmpty. Operand 6336 states and 25713 transitions. [2022-11-19 08:13:39,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 08:13:39,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:39,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:13:39,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 08:13:39,756 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:13:39,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:39,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1844528276, now seen corresponding path program 1 times [2022-11-19 08:13:39,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:13:39,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839157674] [2022-11-19 08:13:39,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:39,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:13:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 08:13:40,042 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:13:40,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839157674] [2022-11-19 08:13:40,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839157674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:40,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:40,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:13:40,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708989789] [2022-11-19 08:13:40,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:40,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:13:40,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:13:40,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:13:40,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:13:40,045 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-11-19 08:13:40,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:40,500 INFO L93 Difference]: Finished difference Result 6338 states and 25715 transitions. [2022-11-19 08:13:40,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:13:40,501 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-11-19 08:13:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:40,552 INFO L225 Difference]: With dead ends: 6338 [2022-11-19 08:13:40,553 INFO L226 Difference]: Without dead ends: 6338 [2022-11-19 08:13:40,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:13:40,554 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 68 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:40,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 74 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 08:13:40,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2022-11-19 08:13:40,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 6338. [2022-11-19 08:13:40,801 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-11-19 08:13:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6338 states to 6338 states and 25715 transitions. [2022-11-19 08:13:40,846 INFO L78 Accepts]: Start accepts. Automaton has 6338 states and 25715 transitions. Word has length 16 [2022-11-19 08:13:40,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:40,847 INFO L495 AbstractCegarLoop]: Abstraction has 6338 states and 25715 transitions. [2022-11-19 08:13:40,847 INFO L496 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-11-19 08:13:40,847 INFO L276 IsEmpty]: Start isEmpty. Operand 6338 states and 25715 transitions. [2022-11-19 08:13:40,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 08:13:40,849 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:40,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:13:40,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 08:13:40,850 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:13:40,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:40,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1022685457, now seen corresponding path program 1 times [2022-11-19 08:13:40,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:13:40,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220429806] [2022-11-19 08:13:40,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:40,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:13:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 08:13:41,594 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:13:41,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220429806] [2022-11-19 08:13:41,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220429806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:41,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:41,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:13:41,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919171300] [2022-11-19 08:13:41,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:41,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:13:41,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:13:41,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:13:41,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:13:41,597 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-11-19 08:13:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:44,557 INFO L93 Difference]: Finished difference Result 9223 states and 37357 transitions. [2022-11-19 08:13:44,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:13:44,559 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-11-19 08:13:44,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:44,738 INFO L225 Difference]: With dead ends: 9223 [2022-11-19 08:13:44,739 INFO L226 Difference]: Without dead ends: 9223 [2022-11-19 08:13:44,739 INFO L412 NwaCegarLoop]: 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-11-19 08:13:44,742 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 104 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:44,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 100 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-19 08:13:44,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9223 states. [2022-11-19 08:13:44,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9223 to 8533. [2022-11-19 08:13:45,016 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-11-19 08:13:45,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8533 states to 8533 states and 35104 transitions. [2022-11-19 08:13:45,067 INFO L78 Accepts]: Start accepts. Automaton has 8533 states and 35104 transitions. Word has length 18 [2022-11-19 08:13:45,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:45,068 INFO L495 AbstractCegarLoop]: Abstraction has 8533 states and 35104 transitions. [2022-11-19 08:13:45,068 INFO L496 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-11-19 08:13:45,068 INFO L276 IsEmpty]: Start isEmpty. Operand 8533 states and 35104 transitions. [2022-11-19 08:13:45,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 08:13:45,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:45,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:13:45,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 08:13:45,073 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:13:45,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:45,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1268855545, now seen corresponding path program 1 times [2022-11-19 08:13:45,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:13:45,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751104145] [2022-11-19 08:13:45,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:45,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:13:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:13:45,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:13:45,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751104145] [2022-11-19 08:13:45,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751104145] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:13:45,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079178598] [2022-11-19 08:13:45,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:45,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:13:45,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:13:45,388 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:13:45,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 08:13:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:45,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:13:45,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:13:45,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:13:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:13:46,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079178598] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:13:46,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1745516024] [2022-11-19 08:13:46,069 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:13:46,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:13:46,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-19 08:13:46,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759004273] [2022-11-19 08:13:46,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:13:46,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-19 08:13:46,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:13:46,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-19 08:13:46,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-19 08:13:46,080 INFO L87 Difference]: Start difference. First operand 8533 states and 35104 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:48,311 INFO L93 Difference]: Finished difference Result 9581 states and 38984 transitions. [2022-11-19 08:13:48,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 08:13:48,312 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 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-11-19 08:13:48,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:48,390 INFO L225 Difference]: With dead ends: 9581 [2022-11-19 08:13:48,390 INFO L226 Difference]: Without dead ends: 9581 [2022-11-19 08:13:48,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-11-19 08:13:48,391 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 124 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:48,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 313 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-19 08:13:48,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9581 states. [2022-11-19 08:13:48,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9581 to 9216. [2022-11-19 08:13:48,678 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-11-19 08:13:48,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 37850 transitions. [2022-11-19 08:13:48,753 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 37850 transitions. Word has length 21 [2022-11-19 08:13:48,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:48,753 INFO L495 AbstractCegarLoop]: Abstraction has 9216 states and 37850 transitions. [2022-11-19 08:13:48,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:48,754 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 37850 transitions. [2022-11-19 08:13:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 08:13:48,758 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:48,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:13:48,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-19 08:13:48,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-19 08:13:48,965 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:13:48,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:48,965 INFO L85 PathProgramCache]: Analyzing trace with hash 406092264, now seen corresponding path program 1 times [2022-11-19 08:13:48,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:13:48,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902179524] [2022-11-19 08:13:48,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:48,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:13:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:49,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:13:49,447 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:13:49,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902179524] [2022-11-19 08:13:49,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902179524] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:13:49,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141066736] [2022-11-19 08:13:49,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:49,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:13:49,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:13:49,450 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:13:49,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 08:13:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:49,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:13:49,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:50,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:13:50,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:13:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:13:50,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141066736] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:13:50,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1829030929] [2022-11-19 08:13:50,235 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:13:50,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:13:50,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-19 08:13:50,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997074209] [2022-11-19 08:13:50,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:13:50,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-19 08:13:50,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:13:50,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-19 08:13:50,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-19 08:13:50,240 INFO L87 Difference]: Start difference. First operand 9216 states and 37850 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:52,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:52,076 INFO L93 Difference]: Finished difference Result 9281 states and 37616 transitions. [2022-11-19 08:13:52,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 08:13:52,077 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-19 08:13:52,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:52,134 INFO L225 Difference]: With dead ends: 9281 [2022-11-19 08:13:52,134 INFO L226 Difference]: Without dead ends: 9281 [2022-11-19 08:13:52,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-11-19 08:13:52,135 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 186 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:52,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 539 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-19 08:13:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9281 states. [2022-11-19 08:13:52,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9281 to 9209. [2022-11-19 08:13:52,459 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-11-19 08:13:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9209 states to 9209 states and 37465 transitions. [2022-11-19 08:13:52,525 INFO L78 Accepts]: Start accepts. Automaton has 9209 states and 37465 transitions. Word has length 21 [2022-11-19 08:13:52,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:52,526 INFO L495 AbstractCegarLoop]: Abstraction has 9209 states and 37465 transitions. [2022-11-19 08:13:52,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 9209 states and 37465 transitions. [2022-11-19 08:13:52,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 08:13:52,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:52,532 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:13:52,543 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-19 08:13:52,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:13:52,738 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:13:52,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:52,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1537991109, now seen corresponding path program 2 times [2022-11-19 08:13:52,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:13:52,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008749700] [2022-11-19 08:13:52,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:52,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:13:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 08:13:55,055 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:13:55,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008749700] [2022-11-19 08:13:55,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008749700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:55,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:55,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-19 08:13:55,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816518017] [2022-11-19 08:13:55,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:55,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-19 08:13:55,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:13:55,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-19 08:13:55,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-19 08:13:55,057 INFO L87 Difference]: Start difference. First operand 9209 states and 37465 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-11-19 08:13:57,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:57,732 INFO L93 Difference]: Finished difference Result 23053 states and 94195 transitions. [2022-11-19 08:13:57,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-19 08:13:57,732 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-11-19 08:13:57,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:57,852 INFO L225 Difference]: With dead ends: 23053 [2022-11-19 08:13:57,852 INFO L226 Difference]: Without dead ends: 23053 [2022-11-19 08:13:57,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2022-11-19 08:13:57,853 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 619 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:57,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 124 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-19 08:13:57,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23053 states. [2022-11-19 08:13:58,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23053 to 9420. [2022-11-19 08:13:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9420 states, 9412 states have (on average 4.14747131321717) internal successors, (39036), 9419 states have internal predecessors, (39036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:13:58,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9420 states to 9420 states and 39036 transitions. [2022-11-19 08:13:58,430 INFO L78 Accepts]: Start accepts. Automaton has 9420 states and 39036 transitions. Word has length 24 [2022-11-19 08:13:58,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:58,431 INFO L495 AbstractCegarLoop]: Abstraction has 9420 states and 39036 transitions. [2022-11-19 08:13:58,431 INFO L496 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-11-19 08:13:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 9420 states and 39036 transitions. [2022-11-19 08:13:58,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 08:13:58,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:58,439 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:13:58,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 08:13:58,440 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:13:58,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:58,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1424882331, now seen corresponding path program 3 times [2022-11-19 08:13:58,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:13:58,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717575990] [2022-11-19 08:13:58,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:58,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:13:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:59,820 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 08:13:59,820 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:13:59,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717575990] [2022-11-19 08:13:59,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717575990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:13:59,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:13:59,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 08:13:59,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985235416] [2022-11-19 08:13:59,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:13:59,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 08:13:59,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:13:59,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 08:13:59,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-19 08:13:59,822 INFO L87 Difference]: Start difference. First operand 9420 states and 39036 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-11-19 08:14:02,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:14:02,404 INFO L93 Difference]: Finished difference Result 19178 states and 79015 transitions. [2022-11-19 08:14:02,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 08:14:02,405 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-11-19 08:14:02,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:14:02,480 INFO L225 Difference]: With dead ends: 19178 [2022-11-19 08:14:02,480 INFO L226 Difference]: Without dead ends: 19178 [2022-11-19 08:14:02,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-19 08:14:02,482 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 384 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:14:02,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 135 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-19 08:14:02,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19178 states. [2022-11-19 08:14:02,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19178 to 9494. [2022-11-19 08:14:02,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9494 states, 9486 states have (on average 4.1502213788741305) internal successors, (39369), 9493 states have internal predecessors, (39369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:02,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9494 states to 9494 states and 39369 transitions. [2022-11-19 08:14:02,868 INFO L78 Accepts]: Start accepts. Automaton has 9494 states and 39369 transitions. Word has length 24 [2022-11-19 08:14:02,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:14:02,868 INFO L495 AbstractCegarLoop]: Abstraction has 9494 states and 39369 transitions. [2022-11-19 08:14:02,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-11-19 08:14:02,869 INFO L276 IsEmpty]: Start isEmpty. Operand 9494 states and 39369 transitions. [2022-11-19 08:14:02,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 08:14:02,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:02,874 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:14:02,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 08:14:02,874 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:14:02,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:02,875 INFO L85 PathProgramCache]: Analyzing trace with hash 675227828, now seen corresponding path program 2 times [2022-11-19 08:14:02,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:14:02,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008177639] [2022-11-19 08:14:02,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:02,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:14:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 08:14:04,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:14:04,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008177639] [2022-11-19 08:14:04,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008177639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:14:04,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:14:04,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-19 08:14:04,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970394628] [2022-11-19 08:14:04,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:14:04,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-19 08:14:04,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:14:04,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-19 08:14:04,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-19 08:14:04,056 INFO L87 Difference]: Start difference. First operand 9494 states and 39369 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-11-19 08:14:05,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:14:05,936 INFO L93 Difference]: Finished difference Result 8914 states and 36833 transitions. [2022-11-19 08:14:05,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:14:05,941 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-11-19 08:14:05,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:14:05,974 INFO L225 Difference]: With dead ends: 8914 [2022-11-19 08:14:05,974 INFO L226 Difference]: Without dead ends: 8914 [2022-11-19 08:14:05,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-11-19 08:14:05,975 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 373 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:14:05,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 72 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-19 08:14:05,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8914 states. [2022-11-19 08:14:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8914 to 6594. [2022-11-19 08:14:06,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6594 states, 6590 states have (on average 4.049924127465857) internal successors, (26689), 6593 states have internal predecessors, (26689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:06,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6594 states to 6594 states and 26689 transitions. [2022-11-19 08:14:06,186 INFO L78 Accepts]: Start accepts. Automaton has 6594 states and 26689 transitions. Word has length 24 [2022-11-19 08:14:06,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:14:06,187 INFO L495 AbstractCegarLoop]: Abstraction has 6594 states and 26689 transitions. [2022-11-19 08:14:06,187 INFO L496 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-11-19 08:14:06,187 INFO L276 IsEmpty]: Start isEmpty. Operand 6594 states and 26689 transitions. [2022-11-19 08:14:06,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 08:14:06,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:06,192 INFO L195 NwaCegarLoop]: 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-11-19 08:14:06,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 08:14:06,193 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:14:06,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:06,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1269804894, now seen corresponding path program 1 times [2022-11-19 08:14:06,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:14:06,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312152146] [2022-11-19 08:14:06,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:06,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:14:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 08:14:06,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:14:06,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312152146] [2022-11-19 08:14:06,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312152146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:14:06,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:14:06,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:14:06,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346336360] [2022-11-19 08:14:06,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:14:06,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:14:06,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:14:06,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:14:06,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:14:06,667 INFO L87 Difference]: Start difference. First operand 6594 states and 26689 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-11-19 08:14:08,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:14:08,339 INFO L93 Difference]: Finished difference Result 7959 states and 32268 transitions. [2022-11-19 08:14:08,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:14:08,340 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-11-19 08:14:08,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:14:08,366 INFO L225 Difference]: With dead ends: 7959 [2022-11-19 08:14:08,366 INFO L226 Difference]: Without dead ends: 7959 [2022-11-19 08:14:08,366 INFO L412 NwaCegarLoop]: 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-11-19 08:14:08,367 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 62 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:14:08,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 66 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-19 08:14:08,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7959 states. [2022-11-19 08:14:08,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7959 to 7404. [2022-11-19 08:14:08,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7404 states, 7400 states have (on average 4.060540540540541) internal successors, (30048), 7403 states have internal predecessors, (30048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:08,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7404 states to 7404 states and 30048 transitions. [2022-11-19 08:14:08,531 INFO L78 Accepts]: Start accepts. Automaton has 7404 states and 30048 transitions. Word has length 25 [2022-11-19 08:14:08,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:14:08,532 INFO L495 AbstractCegarLoop]: Abstraction has 7404 states and 30048 transitions. [2022-11-19 08:14:08,532 INFO L496 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-11-19 08:14:08,532 INFO L276 IsEmpty]: Start isEmpty. Operand 7404 states and 30048 transitions. [2022-11-19 08:14:08,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 08:14:08,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:08,538 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:14:08,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 08:14:08,539 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:14:08,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:08,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2058959913, now seen corresponding path program 4 times [2022-11-19 08:14:08,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:14:08,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895677421] [2022-11-19 08:14:08,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:08,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:14:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:08,959 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:14:08,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:14:08,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895677421] [2022-11-19 08:14:08,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895677421] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:14:08,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488999522] [2022-11-19 08:14:08,960 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 08:14:08,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:14:08,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:14:08,962 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:14:08,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 08:14:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:09,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-19 08:14:09,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:09,588 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:14:09,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:14:09,824 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:14:09,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488999522] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:14:09,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1898280931] [2022-11-19 08:14:09,825 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:14:09,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:14:09,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-11-19 08:14:09,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539357637] [2022-11-19 08:14:09,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:14:09,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-19 08:14:09,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:14:09,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-19 08:14:09,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-19 08:14:09,827 INFO L87 Difference]: Start difference. First operand 7404 states and 30048 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:12,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:14:12,484 INFO L93 Difference]: Finished difference Result 18423 states and 73089 transitions. [2022-11-19 08:14:12,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 08:14:12,489 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-19 08:14:12,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:14:12,560 INFO L225 Difference]: With dead ends: 18423 [2022-11-19 08:14:12,560 INFO L226 Difference]: Without dead ends: 18423 [2022-11-19 08:14:12,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2022-11-19 08:14:12,561 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 607 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:14:12,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1126 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-19 08:14:12,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18423 states. [2022-11-19 08:14:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18423 to 14395. [2022-11-19 08:14:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14395 states, 14391 states have (on average 4.161211868528942) internal successors, (59884), 14394 states have internal predecessors, (59884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14395 states to 14395 states and 59884 transitions. [2022-11-19 08:14:13,009 INFO L78 Accepts]: Start accepts. Automaton has 14395 states and 59884 transitions. Word has length 26 [2022-11-19 08:14:13,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:14:13,010 INFO L495 AbstractCegarLoop]: Abstraction has 14395 states and 59884 transitions. [2022-11-19 08:14:13,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:13,010 INFO L276 IsEmpty]: Start isEmpty. Operand 14395 states and 59884 transitions. [2022-11-19 08:14:13,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 08:14:13,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:13,019 INFO L195 NwaCegarLoop]: 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-11-19 08:14:13,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 08:14:13,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-19 08:14:13,220 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:14:13,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:13,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1891934090, now seen corresponding path program 1 times [2022-11-19 08:14:13,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:14:13,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559961645] [2022-11-19 08:14:13,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:13,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:14:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:13,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 08:14:13,754 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:14:13,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559961645] [2022-11-19 08:14:13,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559961645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:14:13,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:14:13,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:14:13,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430823789] [2022-11-19 08:14:13,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:14:13,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:14:13,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:14:13,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:14:13,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:14:13,756 INFO L87 Difference]: Start difference. First operand 14395 states and 59884 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-11-19 08:14:15,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:14:15,681 INFO L93 Difference]: Finished difference Result 14470 states and 60094 transitions. [2022-11-19 08:14:15,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:14:15,682 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-11-19 08:14:15,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:14:15,733 INFO L225 Difference]: With dead ends: 14470 [2022-11-19 08:14:15,733 INFO L226 Difference]: Without dead ends: 10859 [2022-11-19 08:14:15,733 INFO L412 NwaCegarLoop]: 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-11-19 08:14:15,734 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 32 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-19 08:14:15,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 82 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-19 08:14:15,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10859 states. [2022-11-19 08:14:16,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10859 to 10859. [2022-11-19 08:14:16,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10859 states, 10855 states have (on average 3.936895439889452) internal successors, (42735), 10858 states have internal predecessors, (42735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10859 states to 10859 states and 42735 transitions. [2022-11-19 08:14:16,150 INFO L78 Accepts]: Start accepts. Automaton has 10859 states and 42735 transitions. Word has length 28 [2022-11-19 08:14:16,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:14:16,150 INFO L495 AbstractCegarLoop]: Abstraction has 10859 states and 42735 transitions. [2022-11-19 08:14:16,151 INFO L496 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-11-19 08:14:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 10859 states and 42735 transitions. [2022-11-19 08:14:16,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-19 08:14:16,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:16,158 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:14:16,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 08:14:16,159 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:14:16,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:16,161 INFO L85 PathProgramCache]: Analyzing trace with hash 582938187, now seen corresponding path program 5 times [2022-11-19 08:14:16,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:14:16,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958519972] [2022-11-19 08:14:16,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:16,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:14:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:14:18,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:14:18,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958519972] [2022-11-19 08:14:18,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958519972] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:14:18,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49450705] [2022-11-19 08:14:18,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:14:18,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:14:18,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:14:18,753 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:14:18,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 08:14:19,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-19 08:14:19,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:14:19,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-19 08:14:19,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:19,819 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:14:19,820 INFO L350 Elim1Store]: Elim1 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-11-19 08:14:19,895 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:14:19,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:14:19,987 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:14:19,988 INFO L350 Elim1Store]: Elim1 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-11-19 08:14:20,352 INFO L350 Elim1Store]: Elim1 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-11-19 08:14:20,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:14:20,560 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:14:20,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:14:20,786 INFO L321 Elim1Store]: treesize reduction 527, result has 6.4 percent of original size [2022-11-19 08:14:20,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 101 [2022-11-19 08:14:20,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 84 [2022-11-19 08:14:25,051 INFO L321 Elim1Store]: treesize reduction 289, result has 14.2 percent of original size [2022-11-19 08:14:25,051 INFO L350 Elim1Store]: Elim1 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 25 case distinctions, treesize of input 99 treesize of output 116 [2022-11-19 08:14:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:14:27,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:14:27,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49450705] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:14:27,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:14:27,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 21 [2022-11-19 08:14:27,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627523506] [2022-11-19 08:14:27,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:14:27,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-19 08:14:27,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:14:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-19 08:14:27,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=399, Unknown=1, NotChecked=0, Total=506 [2022-11-19 08:14:27,185 INFO L87 Difference]: Start difference. First operand 10859 states and 42735 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:37,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:14:37,392 INFO L93 Difference]: Finished difference Result 18672 states and 75187 transitions. [2022-11-19 08:14:37,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 08:14:37,392 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-19 08:14:37,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:14:37,469 INFO L225 Difference]: With dead ends: 18672 [2022-11-19 08:14:37,469 INFO L226 Difference]: Without dead ends: 18672 [2022-11-19 08:14:37,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=284, Invalid=769, Unknown=3, NotChecked=0, Total=1056 [2022-11-19 08:14:37,471 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 398 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:14:37,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 206 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 518 Invalid, 0 Unknown, 172 Unchecked, 1.6s Time] [2022-11-19 08:14:37,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18672 states. [2022-11-19 08:14:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18672 to 11673. [2022-11-19 08:14:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11673 states, 11669 states have (on average 3.96983460450767) internal successors, (46324), 11672 states have internal predecessors, (46324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11673 states to 11673 states and 46324 transitions. [2022-11-19 08:14:37,808 INFO L78 Accepts]: Start accepts. Automaton has 11673 states and 46324 transitions. Word has length 29 [2022-11-19 08:14:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:14:37,808 INFO L495 AbstractCegarLoop]: Abstraction has 11673 states and 46324 transitions. [2022-11-19 08:14:37,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 11673 states and 46324 transitions. [2022-11-19 08:14:37,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-19 08:14:37,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:37,813 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:14:37,819 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-19 08:14:38,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-19 08:14:38,014 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:14:38,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:38,014 INFO L85 PathProgramCache]: Analyzing trace with hash 582357867, now seen corresponding path program 6 times [2022-11-19 08:14:38,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:14:38,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130304406] [2022-11-19 08:14:38,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:38,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:14:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:14:40,663 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:14:40,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130304406] [2022-11-19 08:14:40,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130304406] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:14:40,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723450958] [2022-11-19 08:14:40,664 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 08:14:40,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:14:40,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:14:40,666 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:14:40,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 08:14:41,108 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 08:14:41,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:14:41,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-19 08:14:41,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:41,234 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:14:41,234 INFO L350 Elim1Store]: Elim1 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-11-19 08:14:41,297 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:14:41,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:14:41,410 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:14:41,411 INFO L350 Elim1Store]: Elim1 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-11-19 08:14:41,817 INFO L350 Elim1Store]: Elim1 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-11-19 08:14:41,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:14:42,049 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:14:42,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:14:42,196 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:14:42,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-19 08:14:42,492 INFO L321 Elim1Store]: treesize reduction 700, result has 6.4 percent of original size [2022-11-19 08:14:42,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 93 treesize of output 116 [2022-11-19 08:14:42,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 94 [2022-11-19 08:14:46,641 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:14:46,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:14:46,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723450958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:14:46,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:14:46,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2022-11-19 08:14:46,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081303528] [2022-11-19 08:14:46,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:14:46,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-19 08:14:46,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:14:46,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-19 08:14:46,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=472, Unknown=1, NotChecked=0, Total=600 [2022-11-19 08:14:46,644 INFO L87 Difference]: Start difference. First operand 11673 states and 46324 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:55,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:14:55,751 INFO L93 Difference]: Finished difference Result 18672 states and 75002 transitions. [2022-11-19 08:14:55,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 08:14:55,751 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-19 08:14:55,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:14:55,816 INFO L225 Difference]: With dead ends: 18672 [2022-11-19 08:14:55,816 INFO L226 Difference]: Without dead ends: 18524 [2022-11-19 08:14:55,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=325, Invalid=862, Unknown=3, NotChecked=0, Total=1190 [2022-11-19 08:14:55,817 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 448 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:14:55,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 202 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 870 Invalid, 0 Unknown, 150 Unchecked, 2.5s Time] [2022-11-19 08:14:55,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18524 states. [2022-11-19 08:14:56,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18524 to 10785. [2022-11-19 08:14:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10785 states, 10781 states have (on average 3.93646229477785) internal successors, (42439), 10784 states have internal predecessors, (42439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10785 states to 10785 states and 42439 transitions. [2022-11-19 08:14:56,141 INFO L78 Accepts]: Start accepts. Automaton has 10785 states and 42439 transitions. Word has length 29 [2022-11-19 08:14:56,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:14:56,142 INFO L495 AbstractCegarLoop]: Abstraction has 10785 states and 42439 transitions. [2022-11-19 08:14:56,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:56,142 INFO L276 IsEmpty]: Start isEmpty. Operand 10785 states and 42439 transitions. [2022-11-19 08:14:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-19 08:14:56,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:56,151 INFO L195 NwaCegarLoop]: 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-11-19 08:14:56,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 08:14:56,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-19 08:14:56,353 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:14:56,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:56,353 INFO L85 PathProgramCache]: Analyzing trace with hash -756591330, now seen corresponding path program 1 times [2022-11-19 08:14:56,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:14:56,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732673630] [2022-11-19 08:14:56,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:56,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:14:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 08:14:57,885 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:14:57,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732673630] [2022-11-19 08:14:57,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732673630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:14:57,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:14:57,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 08:14:57,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82643536] [2022-11-19 08:14:57,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:14:57,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 08:14:57,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:14:57,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 08:14:57,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:14:57,887 INFO L87 Difference]: Start difference. First operand 10785 states and 42439 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 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-11-19 08:14:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:14:59,873 INFO L93 Difference]: Finished difference Result 23237 states and 90723 transitions. [2022-11-19 08:14:59,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 08:14:59,874 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 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-11-19 08:14:59,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:14:59,947 INFO L225 Difference]: With dead ends: 23237 [2022-11-19 08:14:59,948 INFO L226 Difference]: Without dead ends: 21905 [2022-11-19 08:14:59,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2022-11-19 08:14:59,949 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 429 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:14:59,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 101 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-19 08:14:59,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21905 states. [2022-11-19 08:15:00,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21905 to 13608. [2022-11-19 08:15:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13608 states, 13605 states have (on average 3.92627710400588) internal successors, (53417), 13607 states have internal predecessors, (53417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:00,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13608 states to 13608 states and 53417 transitions. [2022-11-19 08:15:00,350 INFO L78 Accepts]: Start accepts. Automaton has 13608 states and 53417 transitions. Word has length 30 [2022-11-19 08:15:00,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:00,350 INFO L495 AbstractCegarLoop]: Abstraction has 13608 states and 53417 transitions. [2022-11-19 08:15:00,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 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-11-19 08:15:00,350 INFO L276 IsEmpty]: Start isEmpty. Operand 13608 states and 53417 transitions. [2022-11-19 08:15:00,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-19 08:15:00,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:00,358 INFO L195 NwaCegarLoop]: 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-11-19 08:15:00,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-19 08:15:00,358 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:15:00,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:00,358 INFO L85 PathProgramCache]: Analyzing trace with hash 130826430, now seen corresponding path program 2 times [2022-11-19 08:15:00,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:00,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237051481] [2022-11-19 08:15:00,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:00,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 08:15:01,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:01,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237051481] [2022-11-19 08:15:01,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237051481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:15:01,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:15:01,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 08:15:01,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453803166] [2022-11-19 08:15:01,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:15:01,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 08:15:01,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:15:01,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 08:15:01,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:15:01,808 INFO L87 Difference]: Start difference. First operand 13608 states and 53417 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 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-11-19 08:15:04,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:04,099 INFO L93 Difference]: Finished difference Result 22927 states and 90440 transitions. [2022-11-19 08:15:04,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 08:15:04,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 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-11-19 08:15:04,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:04,180 INFO L225 Difference]: With dead ends: 22927 [2022-11-19 08:15:04,181 INFO L226 Difference]: Without dead ends: 22483 [2022-11-19 08:15:04,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2022-11-19 08:15:04,181 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 297 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:04,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 143 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-19 08:15:04,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22483 states. [2022-11-19 08:15:04,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22483 to 13164. [2022-11-19 08:15:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13161 states have (on average 3.932223995137148) internal successors, (51752), 13163 states have internal predecessors, (51752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:04,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 51752 transitions. [2022-11-19 08:15:04,584 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 51752 transitions. Word has length 30 [2022-11-19 08:15:04,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:04,585 INFO L495 AbstractCegarLoop]: Abstraction has 13164 states and 51752 transitions. [2022-11-19 08:15:04,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 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-11-19 08:15:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 51752 transitions. [2022-11-19 08:15:04,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-19 08:15:04,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:04,600 INFO L195 NwaCegarLoop]: 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-11-19 08:15:04,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-19 08:15:04,601 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:15:04,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:04,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1737856023, now seen corresponding path program 1 times [2022-11-19 08:15:04,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:04,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127526277] [2022-11-19 08:15:04,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:04,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:15:04,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:04,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127526277] [2022-11-19 08:15:04,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127526277] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:15:04,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971655150] [2022-11-19 08:15:04,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:04,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:15:04,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:15:04,874 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:15:04,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 08:15:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:05,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:15:05,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:15:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:15:05,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:15:05,574 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:15:05,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971655150] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-19 08:15:05,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-19 08:15:05,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2022-11-19 08:15:05,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674769062] [2022-11-19 08:15:05,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:15:05,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:15:05,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:15:05,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:15:05,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-11-19 08:15:05,575 INFO L87 Difference]: Start difference. First operand 13164 states and 51752 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-11-19 08:15:06,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:06,095 INFO L93 Difference]: Finished difference Result 13164 states and 51452 transitions. [2022-11-19 08:15:06,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:15:06,095 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-11-19 08:15:06,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:06,135 INFO L225 Difference]: With dead ends: 13164 [2022-11-19 08:15:06,135 INFO L226 Difference]: Without dead ends: 13164 [2022-11-19 08:15:06,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-11-19 08:15:06,136 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 174 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:06,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 40 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 08:15:06,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2022-11-19 08:15:06,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 13164. [2022-11-19 08:15:06,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13161 states have (on average 3.9094293746675786) internal successors, (51452), 13163 states have internal predecessors, (51452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 51452 transitions. [2022-11-19 08:15:06,389 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 51452 transitions. Word has length 34 [2022-11-19 08:15:06,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:06,390 INFO L495 AbstractCegarLoop]: Abstraction has 13164 states and 51452 transitions. [2022-11-19 08:15:06,390 INFO L496 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-11-19 08:15:06,390 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 51452 transitions. [2022-11-19 08:15:06,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 08:15:06,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:06,400 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:15:06,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 08:15:06,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:15:06,600 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:15:06,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:06,601 INFO L85 PathProgramCache]: Analyzing trace with hash 990143780, now seen corresponding path program 3 times [2022-11-19 08:15:06,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:06,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532562794] [2022-11-19 08:15:06,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:06,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:08,829 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:15:08,829 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:08,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532562794] [2022-11-19 08:15:08,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532562794] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:15:08,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16178563] [2022-11-19 08:15:08,830 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 08:15:08,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:15:08,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:15:08,833 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:15:08,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 08:15:09,348 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 08:15:09,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:15:09,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-19 08:15:09,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:15:09,468 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:15:09,469 INFO L350 Elim1Store]: Elim1 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-11-19 08:15:09,627 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:15:09,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:15:09,791 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:15:09,791 INFO L350 Elim1Store]: Elim1 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-11-19 08:15:10,541 INFO L350 Elim1Store]: Elim1 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-11-19 08:15:10,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:15:10,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:15:10,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-19 08:15:11,145 INFO L350 Elim1Store]: Elim1 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 124 treesize of output 142 [2022-11-19 08:15:11,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 105 [2022-11-19 08:15:11,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:11,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:11,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:11,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:11,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:11,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:11,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:11,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:11,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:11,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:11,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:11,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:11,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:11,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:11,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:11,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:11,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 107 [2022-11-19 08:15:15,330 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-19 08:15:15,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:15:15,434 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0)) c_~B~0.base) (+ .cse2 c_~B~0.offset) 0) (+ .cse2 c_~B~0.offset 1) 0) (+ .cse2 2 c_~B~0.offset) 0) (+ .cse2 3 c_~B~0.offset) 0))) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_4833 (Array Int Int)) (v_ArrVal_4845 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_4845) c_~B~0.base .cse0) c_~C~0.base v_ArrVal_4833) c_~B~0.base) (+ .cse1 c_~B~0.offset 1)) 0)) (forall ((v_ArrVal_4833 (Array Int Int)) (v_ArrVal_4845 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_4845) c_~B~0.base .cse0) c_~C~0.base v_ArrVal_4833) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)) (forall ((v_ArrVal_4833 (Array Int Int)) (v_ArrVal_4845 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_4845) c_~B~0.base .cse0) c_~C~0.base v_ArrVal_4833) c_~B~0.base) (+ .cse1 3 c_~B~0.offset)) 0)) (forall ((v_ArrVal_4833 (Array Int Int)) (v_ArrVal_4845 (Array Int Int))) (= 0 (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_4845) c_~B~0.base .cse0) c_~C~0.base v_ArrVal_4833) c_~B~0.base) (+ 2 .cse1 c_~B~0.offset)))))) is different from false [2022-11-19 08:15:15,667 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (+ .cse2 3 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse3 0)))) (let ((.cse1 (let ((.cse4 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store .cse0 c_~A~0.base (store (store (store (store (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0)) c_~B~0.base) (+ .cse4 c_~B~0.offset) 0) (+ .cse4 c_~B~0.offset 1) 0) (+ .cse4 2 c_~B~0.offset) 0) (+ .cse4 3 c_~B~0.offset) 0)))) (and (forall ((v_ArrVal_4833 (Array Int Int)) (v_ArrVal_4845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_4845) c_~B~0.base .cse1) c_~C~0.base v_ArrVal_4833) c_~B~0.base) (+ .cse2 c_~B~0.offset)) 0)) (forall ((v_ArrVal_4833 (Array Int Int)) (v_ArrVal_4845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_4845) c_~B~0.base .cse1) c_~C~0.base v_ArrVal_4833) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_4833 (Array Int Int)) (v_ArrVal_4845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_4845) c_~B~0.base .cse1) c_~C~0.base v_ArrVal_4833) c_~B~0.base) (+ 2 .cse2 c_~B~0.offset)) 0)) (forall ((v_ArrVal_4833 (Array Int Int)) (v_ArrVal_4845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~A~0.base v_ArrVal_4845) c_~B~0.base .cse1) c_~C~0.base v_ArrVal_4833) c_~B~0.base) (+ .cse2 c_~B~0.offset 1)) 0))))))) is different from false [2022-11-19 08:15:18,416 INFO L321 Elim1Store]: treesize reduction 1170, result has 11.6 percent of original size [2022-11-19 08:15:18,417 INFO L350 Elim1Store]: Elim1 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 12 case distinctions, treesize of input 197 treesize of output 226 [2022-11-19 08:15:18,450 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-19 08:15:18,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 146 [2022-11-19 08:15:18,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 75 [2022-11-19 08:15:18,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 17 [2022-11-19 08:15:18,709 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:15:18,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 186 treesize of output 394 [2022-11-19 08:15:18,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-19 08:15:19,023 INFO L321 Elim1Store]: treesize reduction 1323, result has 0.1 percent of original size [2022-11-19 08:15:19,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 12 case distinctions, treesize of input 198 treesize of output 1 [2022-11-19 08:15:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 1 not checked. [2022-11-19 08:15:19,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16178563] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:15:19,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1297128908] [2022-11-19 08:15:19,414 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:15:19,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:15:19,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9] total 33 [2022-11-19 08:15:19,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844912962] [2022-11-19 08:15:19,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:15:19,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-19 08:15:19,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:15:19,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-19 08:15:19,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=792, Unknown=18, NotChecked=122, Total=1122 [2022-11-19 08:15:19,417 INFO L87 Difference]: Start difference. First operand 13164 states and 51452 transitions. Second operand has 34 states, 33 states have (on average 2.606060606060606) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:28,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:28,948 INFO L93 Difference]: Finished difference Result 17172 states and 67686 transitions. [2022-11-19 08:15:28,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-19 08:15:28,948 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.606060606060606) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 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 35 [2022-11-19 08:15:28,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:28,997 INFO L225 Difference]: With dead ends: 17172 [2022-11-19 08:15:28,997 INFO L226 Difference]: Without dead ends: 16987 [2022-11-19 08:15:28,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=424, Invalid=1634, Unknown=20, NotChecked=178, Total=2256 [2022-11-19 08:15:28,998 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 532 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 3401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1886 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:28,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 607 Invalid, 3401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1459 Invalid, 0 Unknown, 1886 Unchecked, 3.7s Time] [2022-11-19 08:15:29,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16987 states. [2022-11-19 08:15:29,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16987 to 14414. [2022-11-19 08:15:29,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14414 states, 14411 states have (on average 3.9355353549372007) internal successors, (56715), 14413 states have internal predecessors, (56715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14414 states to 14414 states and 56715 transitions. [2022-11-19 08:15:29,290 INFO L78 Accepts]: Start accepts. Automaton has 14414 states and 56715 transitions. Word has length 35 [2022-11-19 08:15:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:29,290 INFO L495 AbstractCegarLoop]: Abstraction has 14414 states and 56715 transitions. [2022-11-19 08:15:29,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.606060606060606) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:29,290 INFO L276 IsEmpty]: Start isEmpty. Operand 14414 states and 56715 transitions. [2022-11-19 08:15:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 08:15:29,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:29,303 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:15:29,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 08:15:29,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:15:29,504 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:15:29,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:29,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1007938400, now seen corresponding path program 4 times [2022-11-19 08:15:29,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:29,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254463387] [2022-11-19 08:15:29,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:29,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:31,240 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:15:31,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:31,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254463387] [2022-11-19 08:15:31,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254463387] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:15:31,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633991350] [2022-11-19 08:15:31,240 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 08:15:31,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:15:31,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:15:31,242 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:15:31,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 08:15:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:31,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-19 08:15:31,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:15:31,911 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:15:31,911 INFO L350 Elim1Store]: Elim1 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-11-19 08:15:32,084 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:15:32,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:15:32,333 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:15:32,334 INFO L350 Elim1Store]: Elim1 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-11-19 08:15:32,968 INFO L350 Elim1Store]: Elim1 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-11-19 08:15:33,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:15:33,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 24 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 100 [2022-11-19 08:15:33,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 83 [2022-11-19 08:15:33,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 28 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 130 [2022-11-19 08:15:33,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:33,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 145 [2022-11-19 08:15:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 08:15:33,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:15:34,506 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ .cse1 c_~B~0.offset 1))) (let ((.cse0 (let ((.cse4 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse3 (let ((.cse5 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse2 0)))) (store .cse5 c_~A~0.base (store (store (store (store (select .cse5 c_~A~0.base) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))))) (store .cse3 c_~B~0.base (store (store (store (store (select .cse3 c_~B~0.base) (+ .cse4 c_~B~0.offset) 0) (+ .cse4 c_~B~0.offset 1) 0) (+ .cse4 2 c_~B~0.offset) 0) (+ .cse4 3 c_~B~0.offset) 0)))))) (and (forall ((v_ArrVal_5378 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_5378) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)) (forall ((v_ArrVal_5378 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_5378) c_~B~0.base) .cse2) 0)))))) is different from false [2022-11-19 08:15:35,037 INFO L321 Elim1Store]: treesize reduction 2023, result has 6.0 percent of original size [2022-11-19 08:15:35,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 202 treesize of output 142 [2022-11-19 08:15:35,088 INFO L321 Elim1Store]: treesize reduction 466, result has 0.2 percent of original size [2022-11-19 08:15:35,088 INFO L350 Elim1Store]: Elim1 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-11-19 08:15:35,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-19 08:15:35,312 INFO L321 Elim1Store]: treesize reduction 2150, result has 0.0 percent of original size [2022-11-19 08:15:35,312 INFO L350 Elim1Store]: Elim1 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 203 treesize of output 1 [2022-11-19 08:15:35,520 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-19 08:15:35,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633991350] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-19 08:15:35,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-19 08:15:35,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 16] total 34 [2022-11-19 08:15:35,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835647446] [2022-11-19 08:15:35,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:15:35,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 08:15:35,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:15:35,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 08:15:35,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=956, Unknown=8, NotChecked=64, Total=1190 [2022-11-19 08:15:35,523 INFO L87 Difference]: Start difference. First operand 14414 states and 56715 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 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-11-19 08:15:37,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:37,846 INFO L93 Difference]: Finished difference Result 15480 states and 60997 transitions. [2022-11-19 08:15:37,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 08:15:37,847 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 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 35 [2022-11-19 08:15:37,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:37,891 INFO L225 Difference]: With dead ends: 15480 [2022-11-19 08:15:37,891 INFO L226 Difference]: Without dead ends: 15369 [2022-11-19 08:15:37,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=186, Invalid=1210, Unknown=14, NotChecked=72, Total=1482 [2022-11-19 08:15:37,892 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 157 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:37,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 134 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 326 Invalid, 0 Unknown, 277 Unchecked, 1.3s Time] [2022-11-19 08:15:37,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15369 states. [2022-11-19 08:15:38,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15369 to 14424. [2022-11-19 08:15:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14424 states, 14421 states have (on average 3.934886623673809) internal successors, (56745), 14423 states have internal predecessors, (56745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:38,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14424 states to 14424 states and 56745 transitions. [2022-11-19 08:15:38,175 INFO L78 Accepts]: Start accepts. Automaton has 14424 states and 56745 transitions. Word has length 35 [2022-11-19 08:15:38,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:38,175 INFO L495 AbstractCegarLoop]: Abstraction has 14424 states and 56745 transitions. [2022-11-19 08:15:38,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 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-11-19 08:15:38,176 INFO L276 IsEmpty]: Start isEmpty. Operand 14424 states and 56745 transitions. [2022-11-19 08:15:38,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 08:15:38,187 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:38,187 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:15:38,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 08:15:38,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:15:38,388 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:15:38,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:38,388 INFO L85 PathProgramCache]: Analyzing trace with hash 822276444, now seen corresponding path program 5 times [2022-11-19 08:15:38,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:38,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285434139] [2022-11-19 08:15:38,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:38,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:15:40,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:40,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285434139] [2022-11-19 08:15:40,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285434139] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:15:40,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529337916] [2022-11-19 08:15:40,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:15:40,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:15:40,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:15:40,376 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:15:40,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 08:15:41,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-19 08:15:41,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:15:41,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-19 08:15:41,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:15:41,808 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:15:41,808 INFO L350 Elim1Store]: Elim1 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-11-19 08:15:41,854 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:15:41,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:15:41,940 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:15:41,940 INFO L350 Elim1Store]: Elim1 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-11-19 08:15:42,462 INFO L350 Elim1Store]: Elim1 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-11-19 08:15:42,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:15:42,774 INFO L321 Elim1Store]: treesize reduction 352, result has 6.4 percent of original size [2022-11-19 08:15:42,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 130 [2022-11-19 08:15:42,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 113 [2022-11-19 08:15:43,035 INFO L321 Elim1Store]: treesize reduction 235, result has 17.0 percent of original size [2022-11-19 08:15:43,036 INFO L350 Elim1Store]: Elim1 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 25 case distinctions, treesize of input 134 treesize of output 160 [2022-11-19 08:15:43,314 INFO L321 Elim1Store]: treesize reduction 289, result has 14.2 percent of original size [2022-11-19 08:15:43,314 INFO L350 Elim1Store]: Elim1 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 31 case distinctions, treesize of input 146 treesize of output 175 [2022-11-19 08:15:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:15:43,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:15:43,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529337916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:15:43,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:15:43,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2022-11-19 08:15:43,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378881781] [2022-11-19 08:15:43,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:15:43,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-19 08:15:43,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:15:43,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-19 08:15:43,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2022-11-19 08:15:43,475 INFO L87 Difference]: Start difference. First operand 14424 states and 56745 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:45,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:45,544 INFO L93 Difference]: Finished difference Result 19992 states and 80025 transitions. [2022-11-19 08:15:45,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 08:15:45,545 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-19 08:15:45,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:45,609 INFO L225 Difference]: With dead ends: 19992 [2022-11-19 08:15:45,609 INFO L226 Difference]: Without dead ends: 19992 [2022-11-19 08:15:45,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=302, Invalid=888, Unknown=0, NotChecked=0, Total=1190 [2022-11-19 08:15:45,610 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 351 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 654 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:45,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 274 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 620 Invalid, 0 Unknown, 654 Unchecked, 1.4s Time] [2022-11-19 08:15:45,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19992 states. [2022-11-19 08:15:45,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19992 to 14790. [2022-11-19 08:15:45,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14790 states, 14787 states have (on average 3.9517143436802598) internal successors, (58434), 14789 states have internal predecessors, (58434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:45,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14790 states to 14790 states and 58434 transitions. [2022-11-19 08:15:45,967 INFO L78 Accepts]: Start accepts. Automaton has 14790 states and 58434 transitions. Word has length 35 [2022-11-19 08:15:45,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:45,967 INFO L495 AbstractCegarLoop]: Abstraction has 14790 states and 58434 transitions. [2022-11-19 08:15:45,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 14790 states and 58434 transitions. [2022-11-19 08:15:45,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-19 08:15:45,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:45,981 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-11-19 08:15:45,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 08:15:46,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-19 08:15:46,181 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:15:46,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:46,182 INFO L85 PathProgramCache]: Analyzing trace with hash -263773031, now seen corresponding path program 1 times [2022-11-19 08:15:46,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:46,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466792319] [2022-11-19 08:15:46,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:46,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:47,463 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:15:47,463 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:47,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466792319] [2022-11-19 08:15:47,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466792319] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:15:47,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666307730] [2022-11-19 08:15:47,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:47,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:15:47,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:15:47,465 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:15:47,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 08:15:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:48,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-19 08:15:48,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:15:48,103 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:15:48,104 INFO L350 Elim1Store]: Elim1 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-11-19 08:15:48,217 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:15:48,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:15:48,361 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:15:48,361 INFO L350 Elim1Store]: Elim1 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-11-19 08:15:49,128 INFO L350 Elim1Store]: Elim1 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-11-19 08:15:49,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:15:49,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 24 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 125 [2022-11-19 08:15:49,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 108 [2022-11-19 08:15:49,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 28 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 155 [2022-11-19 08:15:49,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:49,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 170 [2022-11-19 08:15:50,074 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-19 08:15:50,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:15:50,200 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (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) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0)))) (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))))) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_6456 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_6456) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)) (forall ((v_ArrVal_6456 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_6456) c_~B~0.base) (+ .cse1 c_~B~0.offset 1)) 0)))) is different from false [2022-11-19 08:15:50,312 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ .cse1 c_~B~0.offset 1))) (let ((.cse0 (let ((.cse4 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse3 (let ((.cse5 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse2 0)))) (store .cse5 c_~A~0.base (store (store (store (store (select .cse5 c_~A~0.base) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))))) (store .cse3 c_~B~0.base (store (store (store (store (select .cse3 c_~B~0.base) (+ .cse4 c_~B~0.offset) 0) (+ .cse4 c_~B~0.offset 1) 0) (+ .cse4 2 c_~B~0.offset) 0) (+ .cse4 3 c_~B~0.offset) 0)))))) (and (forall ((v_ArrVal_6456 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_6456) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)) (forall ((v_ArrVal_6456 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_6456) c_~B~0.base) .cse2) 0)))))) is different from false [2022-11-19 08:15:50,859 INFO L321 Elim1Store]: treesize reduction 2023, result has 6.0 percent of original size [2022-11-19 08:15:50,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 202 treesize of output 142 [2022-11-19 08:15:50,913 INFO L321 Elim1Store]: treesize reduction 466, result has 0.2 percent of original size [2022-11-19 08:15:50,913 INFO L350 Elim1Store]: Elim1 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-11-19 08:15:50,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-19 08:15:51,090 INFO L321 Elim1Store]: treesize reduction 2150, result has 0.0 percent of original size [2022-11-19 08:15:51,091 INFO L350 Elim1Store]: Elim1 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 203 treesize of output 1 [2022-11-19 08:15:51,253 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2022-11-19 08:15:51,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666307730] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:15:51,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1678384026] [2022-11-19 08:15:51,255 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:15:51,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:15:51,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9] total 31 [2022-11-19 08:15:51,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868125910] [2022-11-19 08:15:51,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:15:51,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-19 08:15:51,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:15:51,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-19 08:15:51,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=735, Unknown=2, NotChecked=114, Total=992 [2022-11-19 08:15:51,258 INFO L87 Difference]: Start difference. First operand 14790 states and 58434 transitions. Second operand has 32 states, 31 states have (on average 2.806451612903226) internal successors, (87), 32 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:58,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:58,386 INFO L93 Difference]: Finished difference Result 17970 states and 71850 transitions. [2022-11-19 08:15:58,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-19 08:15:58,387 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.806451612903226) internal successors, (87), 32 states have internal predecessors, (87), 0 states have call successors, (0), 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 36 [2022-11-19 08:15:58,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:58,449 INFO L225 Difference]: With dead ends: 17970 [2022-11-19 08:15:58,449 INFO L226 Difference]: Without dead ends: 17970 [2022-11-19 08:15:58,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=365, Invalid=1533, Unknown=2, NotChecked=170, Total=2070 [2022-11-19 08:15:58,450 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 556 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 3087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1394 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:58,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 620 Invalid, 3087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1623 Invalid, 0 Unknown, 1394 Unchecked, 4.9s Time] [2022-11-19 08:15:58,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17970 states. [2022-11-19 08:15:58,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17970 to 15002. [2022-11-19 08:15:58,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15002 states, 14999 states have (on average 3.965197679845323) internal successors, (59474), 15001 states have internal predecessors, (59474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:58,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15002 states to 15002 states and 59474 transitions. [2022-11-19 08:15:58,814 INFO L78 Accepts]: Start accepts. Automaton has 15002 states and 59474 transitions. Word has length 36 [2022-11-19 08:15:58,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:58,814 INFO L495 AbstractCegarLoop]: Abstraction has 15002 states and 59474 transitions. [2022-11-19 08:15:58,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.806451612903226) internal successors, (87), 32 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:58,814 INFO L276 IsEmpty]: Start isEmpty. Operand 15002 states and 59474 transitions. [2022-11-19 08:15:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-19 08:15:58,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:58,830 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:15:58,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-19 08:15:59,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-19 08:15:59,031 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:15:59,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:59,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1421813057, now seen corresponding path program 1 times [2022-11-19 08:15:59,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:59,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965354944] [2022-11-19 08:15:59,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:59,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:16:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:16:01,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:16:01,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965354944] [2022-11-19 08:16:01,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965354944] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:16:01,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425322208] [2022-11-19 08:16:01,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:16:01,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:16:01,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:16:01,167 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:16:01,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-19 08:16:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:16:01,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 105 conjunts are in the unsatisfiable core [2022-11-19 08:16:01,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:16:01,853 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:16:01,854 INFO L350 Elim1Store]: Elim1 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-11-19 08:16:01,987 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:16:01,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:16:02,108 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:16:02,108 INFO L350 Elim1Store]: Elim1 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-11-19 08:16:02,754 INFO L350 Elim1Store]: Elim1 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-11-19 08:16:02,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:16:02,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:16:03,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 30 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 140 [2022-11-19 08:16:03,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 118 [2022-11-19 08:16:03,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:03,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 170 [2022-11-19 08:16:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-19 08:16:03,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:16:04,399 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ 2 .cse1 c_~B~0.offset))) (let ((.cse0 (let ((.cse4 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse3 (let ((.cse5 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse2 0)))) (store .cse5 c_~A~0.base (store (store (store (store (select .cse5 c_~A~0.base) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))))) (store .cse3 c_~B~0.base (store (store (store (store (select .cse3 c_~B~0.base) (+ .cse4 c_~B~0.offset) 0) (+ .cse4 c_~B~0.offset 1) 0) (+ .cse4 2 c_~B~0.offset) 0) (+ .cse4 3 c_~B~0.offset) 0)))))) (and (forall ((v_ArrVal_6996 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_6996) c_~B~0.base) (+ .cse1 c_~B~0.offset 1)) 0)) (forall ((v_ArrVal_6996 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_6996) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)) (forall ((v_ArrVal_6996 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_6996) c_~B~0.base) .cse2) 0)))))) is different from false [2022-11-19 08:16:05,922 INFO L321 Elim1Store]: treesize reduction 2652, result has 5.0 percent of original size [2022-11-19 08:16:05,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 11 case distinctions, treesize of input 234 treesize of output 155 [2022-11-19 08:16:05,992 INFO L321 Elim1Store]: treesize reduction 599, result has 0.2 percent of original size [2022-11-19 08:16:05,992 INFO L350 Elim1Store]: Elim1 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-11-19 08:16:05,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-19 08:16:06,230 INFO L321 Elim1Store]: treesize reduction 2792, result has 0.0 percent of original size [2022-11-19 08:16:06,230 INFO L350 Elim1Store]: Elim1 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 11 case distinctions, treesize of input 235 treesize of output 1 [2022-11-19 08:16:06,496 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-19 08:16:06,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425322208] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:16:06,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1070157398] [2022-11-19 08:16:06,497 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:16:06,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:16:06,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9] total 32 [2022-11-19 08:16:06,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413088211] [2022-11-19 08:16:06,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:16:06,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-19 08:16:06,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:16:06,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-19 08:16:06,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=814, Unknown=18, NotChecked=60, Total=1056 [2022-11-19 08:16:06,500 INFO L87 Difference]: Start difference. First operand 15002 states and 59474 transitions. Second operand has 33 states, 32 states have (on average 2.78125) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:16:11,225 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4)) (.cse17 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse7 (+ .cse17 c_~B~0.offset)) (.cse8 (+ .cse17 c_~B~0.offset 1)) (.cse9 (+ .cse17 2 c_~B~0.offset)) (.cse10 (+ .cse17 3 c_~B~0.offset)) (.cse11 (+ c_~A~0.offset .cse17)) (.cse12 (+ c_~A~0.offset .cse17 1)) (.cse13 (+ c_~A~0.offset .cse17 2)) (.cse14 (+ c_~A~0.offset .cse17 3)) (.cse4 (+ .cse5 c_~B~0.offset 1)) (.cse1 (+ 2 .cse5 c_~B~0.offset))) (let ((.cse0 (let ((.cse15 (let ((.cse16 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse4 0) .cse1 0)))) (store .cse16 c_~A~0.base (store (store (store (store (select .cse16 c_~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0))))) (store .cse15 c_~B~0.base (store (store (store (store (select .cse15 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0)))) (.cse3 (let ((.cse6 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse6 c_~B~0.base (store (store (store (store (select .cse6 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0)))) (.cse2 (+ .cse5 c_~B~0.offset))) (and (forall ((v_ArrVal_6996 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_6996) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_6996 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_6996) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_6996 (Array Int Int))) (= (select (select (store .cse3 c_~C~0.base v_ArrVal_6996) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_6996 (Array Int Int))) (= (select (select (store .cse3 c_~C~0.base v_ArrVal_6996) c_~B~0.base) .cse4) 0)) (forall ((v_ArrVal_6996 (Array Int Int))) (= (select (select (store .cse3 c_~C~0.base v_ArrVal_6996) c_~B~0.base) .cse2) 0)))))) is different from false [2022-11-19 08:16:13,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:16:13,083 INFO L93 Difference]: Finished difference Result 19158 states and 76939 transitions. [2022-11-19 08:16:13,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-19 08:16:13,084 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.78125) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 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-11-19 08:16:13,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:16:13,146 INFO L225 Difference]: With dead ends: 19158 [2022-11-19 08:16:13,147 INFO L226 Difference]: Without dead ends: 19154 [2022-11-19 08:16:13,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=407, Invalid=1741, Unknown=22, NotChecked=182, Total=2352 [2022-11-19 08:16:13,148 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 612 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 2033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 918 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:16:13,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 615 Invalid, 2033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1079 Invalid, 0 Unknown, 918 Unchecked, 3.5s Time] [2022-11-19 08:16:13,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19154 states. [2022-11-19 08:16:13,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19154 to 16250. [2022-11-19 08:16:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16250 states, 16247 states have (on average 4.002523542807903) internal successors, (65029), 16249 states have internal predecessors, (65029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:16:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16250 states to 16250 states and 65029 transitions. [2022-11-19 08:16:13,509 INFO L78 Accepts]: Start accepts. Automaton has 16250 states and 65029 transitions. Word has length 37 [2022-11-19 08:16:13,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:16:13,509 INFO L495 AbstractCegarLoop]: Abstraction has 16250 states and 65029 transitions. [2022-11-19 08:16:13,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.78125) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:16:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 16250 states and 65029 transitions. [2022-11-19 08:16:13,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-19 08:16:13,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:16:13,525 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:16:13,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-19 08:16:13,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-19 08:16:13,725 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:16:13,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:16:13,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2033711378, now seen corresponding path program 6 times [2022-11-19 08:16:13,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:16:13,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407663638] [2022-11-19 08:16:13,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:16:13,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:16:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:16:14,083 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 08:16:14,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:16:14,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407663638] [2022-11-19 08:16:14,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407663638] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:16:14,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242894255] [2022-11-19 08:16:14,084 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 08:16:14,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:16:14,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:16:14,085 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:16:14,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-19 08:16:14,710 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 08:16:14,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:16:14,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-19 08:16:14,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:16:15,052 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 08:16:15,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:16:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 08:16:15,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242894255] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:16:15,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [764885673] [2022-11-19 08:16:15,387 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:16:15,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:16:15,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-11-19 08:16:15,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232442045] [2022-11-19 08:16:15,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:16:15,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-19 08:16:15,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:16:15,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-19 08:16:15,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2022-11-19 08:16:15,389 INFO L87 Difference]: Start difference. First operand 16250 states and 65029 transitions. Second operand has 22 states, 22 states have (on average 3.0) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:16:18,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:16:18,449 INFO L93 Difference]: Finished difference Result 41906 states and 163699 transitions. [2022-11-19 08:16:18,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-19 08:16:18,450 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 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-11-19 08:16:18,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:16:18,600 INFO L225 Difference]: With dead ends: 41906 [2022-11-19 08:16:18,600 INFO L226 Difference]: Without dead ends: 36670 [2022-11-19 08:16:18,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=298, Invalid=758, Unknown=0, NotChecked=0, Total=1056 [2022-11-19 08:16:18,601 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 876 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:16:18,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 1344 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-19 08:16:18,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36670 states. [2022-11-19 08:16:19,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36670 to 24936. [2022-11-19 08:16:19,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24936 states, 24933 states have (on average 3.9960293586812656) internal successors, (99633), 24935 states have internal predecessors, (99633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:16:19,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24936 states to 24936 states and 99633 transitions. [2022-11-19 08:16:19,517 INFO L78 Accepts]: Start accepts. Automaton has 24936 states and 99633 transitions. Word has length 37 [2022-11-19 08:16:19,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:16:19,517 INFO L495 AbstractCegarLoop]: Abstraction has 24936 states and 99633 transitions. [2022-11-19 08:16:19,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:16:19,517 INFO L276 IsEmpty]: Start isEmpty. Operand 24936 states and 99633 transitions. [2022-11-19 08:16:19,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-19 08:16:19,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:16:19,536 INFO L195 NwaCegarLoop]: 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-11-19 08:16:19,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-19 08:16:19,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-19 08:16:19,738 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:16:19,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:16:19,739 INFO L85 PathProgramCache]: Analyzing trace with hash -797504720, now seen corresponding path program 1 times [2022-11-19 08:16:19,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:16:19,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351049476] [2022-11-19 08:16:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:16:19,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:16:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:16:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:16:19,971 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:16:19,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351049476] [2022-11-19 08:16:19,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351049476] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:16:19,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389716832] [2022-11-19 08:16:19,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:16:19,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:16:19,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:16:19,973 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:16:19,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-19 08:16:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:16:20,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-19 08:16:20,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:16:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:16:20,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:16:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:16:20,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389716832] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:16:20,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [678065633] [2022-11-19 08:16:20,995 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:16:20,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:16:20,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-11-19 08:16:20,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191472369] [2022-11-19 08:16:20,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:16:20,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-19 08:16:20,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:16:20,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-19 08:16:20,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-19 08:16:20,998 INFO L87 Difference]: Start difference. First operand 24936 states and 99633 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-11-19 08:16:23,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:16:23,317 INFO L93 Difference]: Finished difference Result 26482 states and 104643 transitions. [2022-11-19 08:16:23,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 08:16:23,317 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-11-19 08:16:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:16:23,410 INFO L225 Difference]: With dead ends: 26482 [2022-11-19 08:16:23,410 INFO L226 Difference]: Without dead ends: 26482 [2022-11-19 08:16:23,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2022-11-19 08:16:23,411 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 314 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:16:23,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 460 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-19 08:16:23,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26482 states. [2022-11-19 08:16:24,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26482 to 26273. [2022-11-19 08:16:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26273 states, 26270 states have (on average 3.961781499809669) internal successors, (104076), 26272 states have internal predecessors, (104076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:16:24,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26273 states to 26273 states and 104076 transitions. [2022-11-19 08:16:24,587 INFO L78 Accepts]: Start accepts. Automaton has 26273 states and 104076 transitions. Word has length 37 [2022-11-19 08:16:24,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:16:24,587 INFO L495 AbstractCegarLoop]: Abstraction has 26273 states and 104076 transitions. [2022-11-19 08:16:24,587 INFO L496 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-11-19 08:16:24,588 INFO L276 IsEmpty]: Start isEmpty. Operand 26273 states and 104076 transitions. [2022-11-19 08:16:24,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-19 08:16:24,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:16:24,616 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-11-19 08:16:24,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-19 08:16:24,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-19 08:16:24,816 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:16:24,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:16:24,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1126514406, now seen corresponding path program 1 times [2022-11-19 08:16:24,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:16:24,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218687351] [2022-11-19 08:16:24,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:16:24,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:16:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:16:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:16:26,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:16:26,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218687351] [2022-11-19 08:16:26,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218687351] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:16:26,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854453366] [2022-11-19 08:16:26,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:16:26,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:16:26,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:16:26,962 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:16:26,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-19 08:16:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:16:27,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 105 conjunts are in the unsatisfiable core [2022-11-19 08:16:27,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:16:27,709 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:16:27,710 INFO L350 Elim1Store]: Elim1 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-11-19 08:16:27,843 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:16:27,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:16:27,982 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:16:27,982 INFO L350 Elim1Store]: Elim1 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-11-19 08:16:28,619 INFO L350 Elim1Store]: Elim1 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-11-19 08:16:28,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:16:28,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:16:28,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:28,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:28,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:28,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:28,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:28,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:28,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:28,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:28,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:28,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:28,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:28,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:28,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 30 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 140 [2022-11-19 08:16:28,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 118 [2022-11-19 08:16:29,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:29,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:29,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:29,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:29,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:29,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:29,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:29,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:29,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:29,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:29,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:29,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:29,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:29,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:29,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:29,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:29,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 170 [2022-11-19 08:16:29,607 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-19 08:16:29,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:16:31,745 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ .cse1 c_~B~0.offset 1))) (let ((.cse0 (let ((.cse4 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse3 (let ((.cse5 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse2 0) (+ 2 .cse1 c_~B~0.offset) 0)))) (store .cse5 c_~A~0.base (store (store (store (store (select .cse5 c_~A~0.base) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))))) (store .cse3 c_~B~0.base (store (store (store (store (select .cse3 c_~B~0.base) (+ .cse4 c_~B~0.offset) 0) (+ .cse4 c_~B~0.offset 1) 0) (+ .cse4 2 c_~B~0.offset) 0) (+ .cse4 3 c_~B~0.offset) 0)))))) (and (forall ((v_ArrVal_8508 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_8508) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)) (forall ((v_ArrVal_8508 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_8508) c_~B~0.base) .cse2) 0)))))) is different from false [2022-11-19 08:16:32,449 INFO L321 Elim1Store]: treesize reduction 2652, result has 5.0 percent of original size [2022-11-19 08:16:32,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 11 case distinctions, treesize of input 234 treesize of output 155 [2022-11-19 08:16:32,523 INFO L321 Elim1Store]: treesize reduction 599, result has 0.2 percent of original size [2022-11-19 08:16:32,523 INFO L350 Elim1Store]: Elim1 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-11-19 08:16:32,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-19 08:16:32,763 INFO L321 Elim1Store]: treesize reduction 2792, result has 0.0 percent of original size [2022-11-19 08:16:32,763 INFO L350 Elim1Store]: Elim1 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 11 case distinctions, treesize of input 235 treesize of output 1 [2022-11-19 08:16:33,084 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-19 08:16:33,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854453366] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:16:33,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1754009074] [2022-11-19 08:16:33,085 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:16:33,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:16:33,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9] total 32 [2022-11-19 08:16:33,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287886061] [2022-11-19 08:16:33,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:16:33,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-19 08:16:33,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:16:33,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-19 08:16:33,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=825, Unknown=9, NotChecked=60, Total=1056 [2022-11-19 08:16:33,087 INFO L87 Difference]: Start difference. First operand 26273 states and 104076 transitions. Second operand has 33 states, 32 states have (on average 2.84375) internal successors, (91), 33 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:16:43,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:16:43,676 INFO L93 Difference]: Finished difference Result 40402 states and 161440 transitions. [2022-11-19 08:16:43,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-19 08:16:43,676 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.84375) internal successors, (91), 33 states have internal predecessors, (91), 0 states have call successors, (0), 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 38 [2022-11-19 08:16:43,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:16:43,812 INFO L225 Difference]: With dead ends: 40402 [2022-11-19 08:16:43,813 INFO L226 Difference]: Without dead ends: 38988 [2022-11-19 08:16:43,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=451, Invalid=1896, Unknown=9, NotChecked=94, Total=2450 [2022-11-19 08:16:43,813 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 602 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 2999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1603 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:16:43,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 772 Invalid, 2999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1341 Invalid, 0 Unknown, 1603 Unchecked, 4.1s Time] [2022-11-19 08:16:43,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38988 states. [2022-11-19 08:16:44,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38988 to 29039. [2022-11-19 08:16:44,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29039 states, 29036 states have (on average 3.966248794599807) internal successors, (115164), 29038 states have internal predecessors, (115164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:16:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29039 states to 29039 states and 115164 transitions. [2022-11-19 08:16:44,952 INFO L78 Accepts]: Start accepts. Automaton has 29039 states and 115164 transitions. Word has length 38 [2022-11-19 08:16:44,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:16:44,952 INFO L495 AbstractCegarLoop]: Abstraction has 29039 states and 115164 transitions. [2022-11-19 08:16:44,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.84375) internal successors, (91), 33 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:16:44,952 INFO L276 IsEmpty]: Start isEmpty. Operand 29039 states and 115164 transitions. [2022-11-19 08:16:44,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-19 08:16:44,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:16:44,978 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-11-19 08:16:44,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-19 08:16:45,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-19 08:16:45,178 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:16:45,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:16:45,179 INFO L85 PathProgramCache]: Analyzing trace with hash 22569844, now seen corresponding path program 2 times [2022-11-19 08:16:45,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:16:45,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965142912] [2022-11-19 08:16:45,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:16:45,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:16:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:16:46,792 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:16:46,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:16:46,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965142912] [2022-11-19 08:16:46,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965142912] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:16:46,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090531676] [2022-11-19 08:16:46,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:16:46,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:16:46,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:16:46,794 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:16:46,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-19 08:16:52,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-19 08:16:52,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:16:52,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-19 08:16:52,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:16:52,688 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:16:52,688 INFO L350 Elim1Store]: Elim1 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-11-19 08:16:52,754 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:16:52,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:16:52,856 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:16:52,857 INFO L350 Elim1Store]: Elim1 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-11-19 08:16:53,121 INFO L350 Elim1Store]: Elim1 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-11-19 08:16:53,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:53,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2022-11-19 08:16:53,233 INFO L321 Elim1Store]: treesize reduction 176, result has 5.9 percent of original size [2022-11-19 08:16:53,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 62 [2022-11-19 08:16:57,515 INFO L321 Elim1Store]: treesize reduction 181, result has 21.0 percent of original size [2022-11-19 08:16:57,515 INFO L350 Elim1Store]: Elim1 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 14 case distinctions, treesize of input 75 treesize of output 86 [2022-11-19 08:17:05,698 INFO L321 Elim1Store]: treesize reduction 235, result has 17.0 percent of original size [2022-11-19 08:17:05,698 INFO L350 Elim1Store]: Elim1 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 19 case distinctions, treesize of input 87 treesize of output 101 [2022-11-19 08:17:11,888 INFO L321 Elim1Store]: treesize reduction 289, result has 14.2 percent of original size [2022-11-19 08:17:11,888 INFO L350 Elim1Store]: Elim1 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 25 case distinctions, treesize of input 99 treesize of output 116 [2022-11-19 08:17:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-19 08:17:14,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:17:24,282 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9047 (Array Int Int)) (v_ArrVal_9048 (Array Int Int)) (v_ArrVal_9046 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_9048) 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_9047) 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_9046) c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) 0)) is different from false [2022-11-19 08:17:24,294 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:17:24,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 69 [2022-11-19 08:17:24,299 INFO L350 Elim1Store]: Elim1 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-11-19 08:17:24,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 138 [2022-11-19 08:17:24,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 141 [2022-11-19 08:17:24,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-11-19 08:17:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 2 not checked. [2022-11-19 08:17:24,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090531676] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:17:24,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2130379627] [2022-11-19 08:17:24,673 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:17:24,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:17:24,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2022-11-19 08:17:24,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760211980] [2022-11-19 08:17:24,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:17:24,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-19 08:17:24,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:24,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-19 08:17:24,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=631, Unknown=14, NotChecked=52, Total=812 [2022-11-19 08:17:24,677 INFO L87 Difference]: Start difference. First operand 29039 states and 115164 transitions. Second operand has 29 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:19:00,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:19:00,435 INFO L93 Difference]: Finished difference Result 38309 states and 152574 transitions. [2022-11-19 08:19:00,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-19 08:19:00,436 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 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 38 [2022-11-19 08:19:00,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:19:00,785 INFO L225 Difference]: With dead ends: 38309 [2022-11-19 08:19:00,796 INFO L226 Difference]: Without dead ends: 36761 [2022-11-19 08:19:00,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 119.9s TimeCoverageRelationStatistics Valid=778, Invalid=2146, Unknown=50, NotChecked=106, Total=3080 [2022-11-19 08:19:00,798 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 800 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 2533 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 4383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1720 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:19:00,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 724 Invalid, 4383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2533 Invalid, 0 Unknown, 1720 Unchecked, 6.6s Time] [2022-11-19 08:19:00,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36761 states. [2022-11-19 08:19:01,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36761 to 27695. [2022-11-19 08:19:01,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27695 states, 27692 states have (on average 3.9377076411960132) internal successors, (109043), 27694 states have internal predecessors, (109043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:19:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27695 states to 27695 states and 109043 transitions. [2022-11-19 08:19:01,797 INFO L78 Accepts]: Start accepts. Automaton has 27695 states and 109043 transitions. Word has length 38 [2022-11-19 08:19:01,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:19:01,797 INFO L495 AbstractCegarLoop]: Abstraction has 27695 states and 109043 transitions. [2022-11-19 08:19:01,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:19:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 27695 states and 109043 transitions. [2022-11-19 08:19:01,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-19 08:19:01,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:19:01,831 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-11-19 08:19:01,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-19 08:19:02,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-19 08:19:02,032 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:19:02,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:19:02,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1955472171, now seen corresponding path program 1 times [2022-11-19 08:19:02,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:19:02,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896587040] [2022-11-19 08:19:02,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:19:02,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:19:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:19:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:19:03,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:19:03,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896587040] [2022-11-19 08:19:03,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896587040] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:19:03,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959422030] [2022-11-19 08:19:03,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:19:03,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:19:03,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:19:03,910 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:19:03,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-19 08:19:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:19:04,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-19 08:19:04,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:19:04,710 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:19:04,710 INFO L350 Elim1Store]: Elim1 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-11-19 08:19:04,881 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:19:04,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:19:05,104 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:19:05,104 INFO L350 Elim1Store]: Elim1 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-11-19 08:19:05,853 INFO L350 Elim1Store]: Elim1 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-11-19 08:19:05,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:19:06,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 24 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 100 [2022-11-19 08:19:06,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 83 [2022-11-19 08:19:06,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 28 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 130 [2022-11-19 08:19:06,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:06,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 145 [2022-11-19 08:19:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 08:19:06,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:19:07,095 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (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) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0)))) (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))))) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_9596 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_9596) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)) (forall ((v_ArrVal_9596 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_9596) c_~B~0.base) (+ .cse1 c_~B~0.offset 1)) 0)))) is different from false [2022-11-19 08:19:07,268 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ .cse2 c_~B~0.offset 1))) (let ((.cse0 (let ((.cse4 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse3 (let ((.cse5 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse1 0)))) (store .cse5 c_~A~0.base (store (store (store (store (select .cse5 c_~A~0.base) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))))) (store .cse3 c_~B~0.base (store (store (store (store (select .cse3 c_~B~0.base) (+ .cse4 c_~B~0.offset) 0) (+ .cse4 c_~B~0.offset 1) 0) (+ .cse4 2 c_~B~0.offset) 0) (+ .cse4 3 c_~B~0.offset) 0)))))) (and (forall ((v_ArrVal_9596 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_9596) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_9596 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_9596) c_~B~0.base) (+ .cse2 c_~B~0.offset)) 0)))))) is different from false [2022-11-19 08:19:07,804 INFO L321 Elim1Store]: treesize reduction 2023, result has 6.0 percent of original size [2022-11-19 08:19:07,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 203 treesize of output 143 [2022-11-19 08:19:07,857 INFO L321 Elim1Store]: treesize reduction 466, result has 0.2 percent of original size [2022-11-19 08:19:07,858 INFO L350 Elim1Store]: Elim1 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-11-19 08:19:07,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-11-19 08:19:08,107 INFO L321 Elim1Store]: treesize reduction 2150, result has 0.0 percent of original size [2022-11-19 08:19:08,107 INFO L350 Elim1Store]: Elim1 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-11-19 08:19:08,285 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 2 not checked. [2022-11-19 08:19:08,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959422030] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:19:08,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [463009012] [2022-11-19 08:19:08,286 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:19:08,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:19:08,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 9] total 34 [2022-11-19 08:19:08,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221317612] [2022-11-19 08:19:08,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:19:08,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-19 08:19:08,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:19:08,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-19 08:19:08,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=903, Unknown=2, NotChecked=126, Total=1190 [2022-11-19 08:19:08,293 INFO L87 Difference]: Start difference. First operand 27695 states and 109043 transitions. Second operand has 35 states, 34 states have (on average 2.823529411764706) internal successors, (96), 35 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:19:18,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:19:18,181 INFO L93 Difference]: Finished difference Result 38095 states and 150901 transitions. [2022-11-19 08:19:18,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-19 08:19:18,182 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.823529411764706) internal successors, (96), 35 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-19 08:19:18,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:19:18,299 INFO L225 Difference]: With dead ends: 38095 [2022-11-19 08:19:18,299 INFO L226 Difference]: Without dead ends: 37539 [2022-11-19 08:19:18,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=567, Invalid=2630, Unknown=3, NotChecked=222, Total=3422 [2022-11-19 08:19:18,300 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 787 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 3699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1493 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-19 08:19:18,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 860 Invalid, 3699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2129 Invalid, 0 Unknown, 1493 Unchecked, 5.8s Time] [2022-11-19 08:19:18,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37539 states. [2022-11-19 08:19:19,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37539 to 32017. [2022-11-19 08:19:19,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32017 states, 32014 states have (on average 3.97944649215968) internal successors, (127398), 32016 states have internal predecessors, (127398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:19:19,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32017 states to 32017 states and 127398 transitions. [2022-11-19 08:19:19,235 INFO L78 Accepts]: Start accepts. Automaton has 32017 states and 127398 transitions. Word has length 39 [2022-11-19 08:19:19,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:19:19,236 INFO L495 AbstractCegarLoop]: Abstraction has 32017 states and 127398 transitions. [2022-11-19 08:19:19,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.823529411764706) internal successors, (96), 35 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:19:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 32017 states and 127398 transitions. [2022-11-19 08:19:19,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-19 08:19:19,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:19:19,454 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-11-19 08:19:19,477 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-19 08:19:19,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-19 08:19:19,655 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:19:19,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:19:19,656 INFO L85 PathProgramCache]: Analyzing trace with hash -926507995, now seen corresponding path program 2 times [2022-11-19 08:19:19,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:19:19,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069164405] [2022-11-19 08:19:19,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:19:19,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:19:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:19:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:19:21,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:19:21,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069164405] [2022-11-19 08:19:21,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069164405] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:19:21,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180345876] [2022-11-19 08:19:21,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:19:21,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:19:21,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:19:21,523 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:19:21,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-19 08:19:23,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-19 08:19:23,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:19:23,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-19 08:19:23,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:19:23,649 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:19:23,650 INFO L350 Elim1Store]: Elim1 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-11-19 08:19:23,851 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:19:23,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:19:24,029 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:19:24,030 INFO L350 Elim1Store]: Elim1 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-11-19 08:19:24,424 INFO L350 Elim1Store]: Elim1 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-11-19 08:19:24,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:19:24,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:24,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 66 [2022-11-19 08:19:24,694 INFO L321 Elim1Store]: treesize reduction 352, result has 6.4 percent of original size [2022-11-19 08:19:24,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 77 [2022-11-19 08:19:35,070 INFO L321 Elim1Store]: treesize reduction 235, result has 17.0 percent of original size [2022-11-19 08:19:35,071 INFO L350 Elim1Store]: Elim1 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 19 case distinctions, treesize of input 87 treesize of output 101 [2022-11-19 08:19:37,305 INFO L321 Elim1Store]: treesize reduction 289, result has 14.2 percent of original size [2022-11-19 08:19:37,305 INFO L350 Elim1Store]: Elim1 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 25 case distinctions, treesize of input 99 treesize of output 116 [2022-11-19 08:19:39,498 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 08:19:39,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:19:39,694 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((|thread2Thread1of1ForFork0_~i~1#1| Int)) (or (forall ((v_ArrVal_10118 (Array Int Int)) (v_ArrVal_10124 (Array Int Int)) (v_ArrVal_10122 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_10118) 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_10124) 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_10122) c_~B~0.base) (+ .cse1 c_~B~0.offset 1)) 0)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0))) (forall ((|thread2Thread1of1ForFork0_~i~1#1| Int)) (or (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0) (forall ((v_ArrVal_10118 (Array Int Int)) (v_ArrVal_10124 (Array Int Int)) (v_ArrVal_10122 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_10118) c_~B~0.base (let ((.cse2 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store |c_#race| c_~A~0.base v_ArrVal_10124) c_~B~0.base) (+ .cse2 c_~B~0.offset) 0) (+ .cse2 c_~B~0.offset 1) 0) (+ 2 .cse2 c_~B~0.offset) 0) (+ 3 .cse2 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_10122) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)))))) is different from false [2022-11-19 08:19:44,362 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:19:44,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 82 [2022-11-19 08:19:44,369 INFO L350 Elim1Store]: Elim1 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 136 treesize of output 130 [2022-11-19 08:19:44,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-19 08:19:44,388 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:19:44,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 147 [2022-11-19 08:19:44,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 92 [2022-11-19 08:19:44,470 INFO L321 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-11-19 08:19:44,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 1 [2022-11-19 08:19:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2022-11-19 08:19:45,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180345876] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:19:45,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [493461918] [2022-11-19 08:19:45,080 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:19:45,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:19:45,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 14] total 36 [2022-11-19 08:19:45,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477004921] [2022-11-19 08:19:45,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:19:45,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-19 08:19:45,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:19:45,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-19 08:19:45,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1145, Unknown=7, NotChecked=70, Total=1406 [2022-11-19 08:19:45,083 INFO L87 Difference]: Start difference. First operand 32017 states and 127398 transitions. Second operand has 38 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 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-11-19 08:22:39,701 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (select |c_#race| c_~B~0.base)) (.cse2 (+ .cse6 c_~B~0.offset 1))) (let ((.cse3 (store |c_#race| c_~B~0.base (store .cse0 .cse2 0))) (.cse1 (+ .cse6 c_~B~0.offset))) (and (not (= c_~C~0.base c_~A~0.base)) (<= 3 c_~N~0) (or (and (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0)) (< |c_thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (forall ((|thread2Thread1of1ForFork0_~i~1#1| Int)) (or (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0) (forall ((v_ArrVal_10118 (Array Int Int)) (v_ArrVal_10124 (Array Int Int)) (v_ArrVal_10122 (Array Int Int))) (= (select (select (store (store (store .cse3 c_~A~0.base v_ArrVal_10118) c_~B~0.base (let ((.cse4 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store .cse3 c_~A~0.base v_ArrVal_10124) c_~B~0.base) (+ .cse4 c_~B~0.offset) 0) (+ .cse4 c_~B~0.offset 1) 0) (+ 2 .cse4 c_~B~0.offset) 0) (+ 3 .cse4 c_~B~0.offset) 0))) c_~C~0.base v_ArrVal_10122) c_~B~0.base) .cse2) 0)))) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (= |c_thread2Thread1of1ForFork0_~i~1#1| 1) (forall ((|thread2Thread1of1ForFork0_~i~1#1| Int)) (or (forall ((v_ArrVal_10118 (Array Int Int)) (v_ArrVal_10124 (Array Int Int)) (v_ArrVal_10122 (Array Int Int))) (= (select (select (store (store (store .cse3 c_~A~0.base v_ArrVal_10118) c_~B~0.base (let ((.cse5 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select (store .cse3 c_~A~0.base v_ArrVal_10124) 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_10122) c_~B~0.base) .cse1) 0)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0))))))) is different from false [2022-11-19 08:22:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:22:44,377 INFO L93 Difference]: Finished difference Result 67845 states and 267396 transitions. [2022-11-19 08:22:44,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-19 08:22:44,378 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 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 39 [2022-11-19 08:22:44,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:22:44,924 INFO L225 Difference]: With dead ends: 67845 [2022-11-19 08:22:44,924 INFO L226 Difference]: Without dead ends: 67379 [2022-11-19 08:22:44,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 66 SyntacticMatches, 10 SemanticMatches, 81 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2085 ImplicationChecksByTransitivity, 188.5s TimeCoverageRelationStatistics Valid=1082, Invalid=5333, Unknown=73, NotChecked=318, Total=6806 [2022-11-19 08:22:44,936 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 1066 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 3422 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 8569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 3422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4982 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:22:44,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 1497 Invalid, 8569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 3422 Invalid, 0 Unknown, 4982 Unchecked, 10.0s Time] [2022-11-19 08:22:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67379 states. [2022-11-19 08:22:46,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67379 to 44811. [2022-11-19 08:22:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44811 states, 44808 states have (on average 4.004642028209249) internal successors, (179440), 44810 states have internal predecessors, (179440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:22:46,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44811 states to 44811 states and 179440 transitions. [2022-11-19 08:22:46,749 INFO L78 Accepts]: Start accepts. Automaton has 44811 states and 179440 transitions. Word has length 39 [2022-11-19 08:22:46,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:22:46,749 INFO L495 AbstractCegarLoop]: Abstraction has 44811 states and 179440 transitions. [2022-11-19 08:22:46,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 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-11-19 08:22:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 44811 states and 179440 transitions. [2022-11-19 08:22:46,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-19 08:22:46,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:22:46,785 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-11-19 08:22:46,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-19 08:22:46,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:22:46,991 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:22:46,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:22:46,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1263548021, now seen corresponding path program 3 times [2022-11-19 08:22:46,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:22:46,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918049871] [2022-11-19 08:22:46,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:22:46,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:22:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:22:48,834 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:22:48,834 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:22:48,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918049871] [2022-11-19 08:22:48,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918049871] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:22:48,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031845839] [2022-11-19 08:22:48,834 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 08:22:48,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:22:48,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:22:48,836 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:22:48,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-19 08:22:49,641 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 08:22:49,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:22:49,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-19 08:22:49,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:22:49,748 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:22:49,749 INFO L350 Elim1Store]: Elim1 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-11-19 08:22:50,009 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:22:50,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:22:50,178 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:22:50,179 INFO L350 Elim1Store]: Elim1 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-11-19 08:22:50,834 INFO L350 Elim1Store]: Elim1 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-11-19 08:22:50,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:22:51,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:51,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:51,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:51,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:51,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:51,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:51,199 INFO L321 Elim1Store]: treesize reduction 57, result has 29.6 percent of original size [2022-11-19 08:22:51,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 22 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 125 [2022-11-19 08:22:51,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 108 [2022-11-19 08:22:53,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:53,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:53,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:53,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:53,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:53,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:53,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:53,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:53,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:53,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:53,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:53,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:53,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 28 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 155 [2022-11-19 08:22:54,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:54,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:54,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:54,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:54,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:54,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:54,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:54,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:54,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:54,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:54,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:54,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:54,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:54,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:54,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:54,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:22:54,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 170 [2022-11-19 08:22:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 08:22:54,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:23:02,090 INFO L321 Elim1Store]: treesize reduction 2023, result has 6.0 percent of original size [2022-11-19 08:23:02,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 202 treesize of output 142 [2022-11-19 08:23:02,142 INFO L321 Elim1Store]: treesize reduction 466, result has 0.2 percent of original size [2022-11-19 08:23:02,143 INFO L350 Elim1Store]: Elim1 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-11-19 08:23:02,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-19 08:23:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-19 08:23:02,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031845839] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:23:02,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [463859094] [2022-11-19 08:23:02,421 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:23:02,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:23:02,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 10] total 33 [2022-11-19 08:23:02,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320486435] [2022-11-19 08:23:02,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:23:02,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-19 08:23:02,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:23:02,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-19 08:23:02,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=975, Unknown=3, NotChecked=0, Total=1122 [2022-11-19 08:23:02,424 INFO L87 Difference]: Start difference. First operand 44811 states and 179440 transitions. Second operand has 34 states, 33 states have (on average 2.909090909090909) internal successors, (96), 34 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:23:35,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:23:35,713 INFO L93 Difference]: Finished difference Result 55263 states and 218602 transitions. [2022-11-19 08:23:35,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-19 08:23:35,714 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.909090909090909) internal successors, (96), 34 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-19 08:23:35,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:23:35,901 INFO L225 Difference]: With dead ends: 55263 [2022-11-19 08:23:35,901 INFO L226 Difference]: Without dead ends: 54947 [2022-11-19 08:23:35,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1893 ImplicationChecksByTransitivity, 35.5s TimeCoverageRelationStatistics Valid=956, Invalid=5514, Unknown=10, NotChecked=0, Total=6480 [2022-11-19 08:23:35,903 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 1120 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 2990 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 6621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 2990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3443 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-19 08:23:35,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 1296 Invalid, 6621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 2990 Invalid, 0 Unknown, 3443 Unchecked, 7.8s Time] [2022-11-19 08:23:35,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54947 states. [2022-11-19 08:23:37,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54947 to 44468. [2022-11-19 08:23:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44468 states, 44465 states have (on average 4.012684133588215) internal successors, (178424), 44467 states have internal predecessors, (178424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:23:37,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44468 states to 44468 states and 178424 transitions. [2022-11-19 08:23:37,447 INFO L78 Accepts]: Start accepts. Automaton has 44468 states and 178424 transitions. Word has length 39 [2022-11-19 08:23:37,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:23:37,447 INFO L495 AbstractCegarLoop]: Abstraction has 44468 states and 178424 transitions. [2022-11-19 08:23:37,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.909090909090909) internal successors, (96), 34 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:23:37,447 INFO L276 IsEmpty]: Start isEmpty. Operand 44468 states and 178424 transitions. [2022-11-19 08:23:37,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-19 08:23:37,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:23:37,482 INFO L195 NwaCegarLoop]: 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-11-19 08:23:37,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-19 08:23:37,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:23:37,685 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:23:37,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:23:37,685 INFO L85 PathProgramCache]: Analyzing trace with hash 966758460, now seen corresponding path program 2 times [2022-11-19 08:23:37,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:23:37,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257448128] [2022-11-19 08:23:37,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:23:37,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:23:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:23:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:23:39,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:23:39,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257448128] [2022-11-19 08:23:39,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257448128] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:23:39,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049324214] [2022-11-19 08:23:39,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:23:39,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:23:39,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:23:39,233 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:23:39,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-19 08:23:39,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 08:23:39,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:23:39,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-19 08:23:39,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:23:40,040 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-19 08:23:40,040 INFO L350 Elim1Store]: Elim1 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-11-19 08:23:40,080 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:23:40,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:23:40,159 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-19 08:23:40,160 INFO L350 Elim1Store]: Elim1 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-11-19 08:23:40,423 INFO L350 Elim1Store]: Elim1 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-11-19 08:23:40,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 08:23:40,543 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:23:40,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:23:40,698 INFO L321 Elim1Store]: treesize reduction 527, result has 6.4 percent of original size [2022-11-19 08:23:40,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 101 [2022-11-19 08:23:40,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 84 [2022-11-19 08:23:48,926 INFO L321 Elim1Store]: treesize reduction 289, result has 14.2 percent of original size [2022-11-19 08:23:48,927 INFO L350 Elim1Store]: Elim1 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 25 case distinctions, treesize of input 99 treesize of output 116 [2022-11-19 08:23:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 08:23:48,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:23:50,244 INFO L321 Elim1Store]: treesize reduction 557, result has 13.9 percent of original size [2022-11-19 08:23:50,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 76 treesize of output 107 [2022-11-19 08:23:50,262 INFO L321 Elim1Store]: treesize reduction 162, result has 0.6 percent of original size [2022-11-19 08:23:50,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 157 treesize of output 88 [2022-11-19 08:23:50,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2022-11-19 08:23:50,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-11-19 08:23:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 2 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 08:23:50,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049324214] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:23:50,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1502826062] [2022-11-19 08:23:50,606 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 08:23:50,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:23:50,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 24 [2022-11-19 08:23:50,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167802822] [2022-11-19 08:23:50,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:23:50,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-19 08:23:50,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:23:50,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-19 08:23:50,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=531, Unknown=20, NotChecked=0, Total=650 [2022-11-19 08:23:50,609 INFO L87 Difference]: Start difference. First operand 44468 states and 178424 transitions. Second operand has 26 states, 25 states have (on average 3.6) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:24:42,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:24:42,224 INFO L93 Difference]: Finished difference Result 88439 states and 356626 transitions. [2022-11-19 08:24:42,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-19 08:24:42,227 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.6) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 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-11-19 08:24:42,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:24:42,708 INFO L225 Difference]: With dead ends: 88439 [2022-11-19 08:24:42,709 INFO L226 Difference]: Without dead ends: 88439 [2022-11-19 08:24:42,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 55.3s TimeCoverageRelationStatistics Valid=708, Invalid=1806, Unknown=36, NotChecked=0, Total=2550 [2022-11-19 08:24:42,710 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 693 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 629 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:24:42,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 527 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1522 Invalid, 0 Unknown, 629 Unchecked, 5.0s Time] [2022-11-19 08:24:42,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88439 states. [2022-11-19 08:24:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88439 to 53698. [2022-11-19 08:24:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53698 states, 53695 states have (on average 4.052295372008567) internal successors, (217588), 53697 states have internal predecessors, (217588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:24:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53698 states to 53698 states and 217588 transitions. [2022-11-19 08:24:45,619 INFO L78 Accepts]: Start accepts. Automaton has 53698 states and 217588 transitions. Word has length 40 [2022-11-19 08:24:45,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:24:45,619 INFO L495 AbstractCegarLoop]: Abstraction has 53698 states and 217588 transitions. [2022-11-19 08:24:45,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.6) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:24:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 53698 states and 217588 transitions. [2022-11-19 08:24:45,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-19 08:24:45,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:24:45,689 INFO L195 NwaCegarLoop]: 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-11-19 08:24:45,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-19 08:24:45,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:24:45,898 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-19 08:24:45,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:24:45,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1444111492, now seen corresponding path program 3 times [2022-11-19 08:24:45,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:24:45,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161707685] [2022-11-19 08:24:45,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:24:45,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:24:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:24:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-19 08:24:47,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:24:47,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161707685] [2022-11-19 08:24:47,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161707685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:24:47,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172817159] [2022-11-19 08:24:47,741 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 08:24:47,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:24:47,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:24:47,746 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:24:47,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c050909c-2d21-455e-a9c0-0ea251d4030a/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process