./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 9bd2c7ff 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_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr-race.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --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 3b48d748645bdde1aeeb8dea66ba49bd5b185acd910927d963305195a7958388 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:05:37,098 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:05:37,214 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DataRace-32bit-Taipan_Default.epf [2023-11-19 05:05:37,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:05:37,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:05:37,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:05:37,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:05:37,269 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:05:37,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:05:37,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:05:37,275 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:05:37,276 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:05:37,277 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:05:37,278 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:05:37,279 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:05:37,279 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:05:37,280 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:05:37,280 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:05:37,280 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:05:37,281 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:05:37,281 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:05:37,282 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:05:37,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:05:37,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 05:05:37,284 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:05:37,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:05:37,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:05:37,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:05:37,286 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 05:05:37,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:05:37,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 05:05:37,288 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-19 05:05:37,288 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 05:05:37,288 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:05:37,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 05:05:37,289 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:05:37,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:05:37,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:05:37,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:05:37,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:05:37,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:05:37,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 05:05:37,291 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:05:37,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:05:37,292 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 05:05:37,292 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:05:37,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:05:37,293 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/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_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 3b48d748645bdde1aeeb8dea66ba49bd5b185acd910927d963305195a7958388 [2023-11-19 05:05:37,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:05:37,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:05:37,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:05:37,623 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:05:37,624 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:05:37,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr-race.i [2023-11-19 05:05:40,746 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:05:41,099 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:05:41,100 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr-race.i [2023-11-19 05:05:41,123 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/data/d0d579836/509e35923ddf4fe49851e97c6434c829/FLAG8bd90aee7 [2023-11-19 05:05:41,138 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/data/d0d579836/509e35923ddf4fe49851e97c6434c829 [2023-11-19 05:05:41,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:05:41,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:05:41,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:05:41,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:05:41,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:05:41,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:05:41" (1/1) ... [2023-11-19 05:05:41,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ef70a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:41, skipping insertion in model container [2023-11-19 05:05:41,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:05:41" (1/1) ... [2023-11-19 05:05:41,238 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:05:41,441 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-19 05:05:41,703 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:05:41,711 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:05:41,726 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-19 05:05:41,756 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:05:41,856 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 05:05:41,864 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:05:41,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:41 WrapperNode [2023-11-19 05:05:41,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:05:41,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:05:41,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:05:41,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:05:41,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:41" (1/1) ... [2023-11-19 05:05:41,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:41" (1/1) ... [2023-11-19 05:05:41,936 INFO L138 Inliner]: procedures = 266, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2023-11-19 05:05:41,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:05:41,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:05:41,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:05:41,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:05:41,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:41" (1/1) ... [2023-11-19 05:05:41,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:41" (1/1) ... [2023-11-19 05:05:41,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:41" (1/1) ... [2023-11-19 05:05:41,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:41" (1/1) ... [2023-11-19 05:05:41,987 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:41" (1/1) ... [2023-11-19 05:05:42,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:41" (1/1) ... [2023-11-19 05:05:42,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:41" (1/1) ... [2023-11-19 05:05:42,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:41" (1/1) ... [2023-11-19 05:05:42,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:05:42,022 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:05:42,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:05:42,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:05:42,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:41" (1/1) ... [2023-11-19 05:05:42,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:05:42,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:05:42,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:05:42,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:05:42,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 05:05:42,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 05:05:42,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:05:42,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 05:05:42,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 05:05:42,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:05:42,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 05:05:42,114 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-19 05:05:42,114 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-19 05:05:42,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:05:42,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:05:42,116 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 05:05:42,279 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:05:42,281 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:05:42,584 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:05:42,594 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:05:42,594 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 05:05:42,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:05:42 BoogieIcfgContainer [2023-11-19 05:05:42,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:05:42,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:05:42,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:05:42,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:05:42,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:05:41" (1/3) ... [2023-11-19 05:05:42,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@abccafa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:05:42, skipping insertion in model container [2023-11-19 05:05:42,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:41" (2/3) ... [2023-11-19 05:05:42,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@abccafa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:05:42, skipping insertion in model container [2023-11-19 05:05:42,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:05:42" (3/3) ... [2023-11-19 05:05:42,608 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr-race.i [2023-11-19 05:05:42,616 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 05:05:42,643 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:05:42,644 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-19 05:05:42,644 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 05:05:42,743 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-19 05:05:42,776 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 05:05:42,790 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 122 transitions, 251 flow [2023-11-19 05:05:42,793 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 122 transitions, 251 flow [2023-11-19 05:05:42,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 251 flow [2023-11-19 05:05:42,879 INFO L124 PetriNetUnfolderBase]: 6/188 cut-off events. [2023-11-19 05:05:42,880 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-19 05:05:42,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 188 events. 6/188 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 372 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 91. Up to 4 conditions per place. [2023-11-19 05:05:42,888 INFO L119 LiptonReduction]: Number of co-enabled transitions 2368 [2023-11-19 05:06:03,853 INFO L134 LiptonReduction]: Checked pairs total: 9574 [2023-11-19 05:06:03,853 INFO L136 LiptonReduction]: Total number of compositions: 71 [2023-11-19 05:06:03,861 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 57 transitions, 121 flow [2023-11-19 05:06:03,904 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 422 states, 398 states have (on average 1.8693467336683418) internal successors, (744), 421 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:03,924 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:06:03,931 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=LoopHeads, 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;@3d8fcb9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:06:03,931 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-11-19 05:06:03,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 422 states, 398 states have (on average 1.8693467336683418) internal successors, (744), 421 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:03,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-19 05:06:03,941 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:06:03,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:06:03,942 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 05:06:03,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:06:03,948 INFO L85 PathProgramCache]: Analyzing trace with hash -315415979, now seen corresponding path program 1 times [2023-11-19 05:06:03,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:06:03,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583622021] [2023-11-19 05:06:03,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:06:03,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:06:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:06:04,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:04,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:06:04,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583622021] [2023-11-19 05:06:04,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583622021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:06:04,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:06:04,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:06:04,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137237209] [2023-11-19 05:06:04,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:06:04,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:06:04,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:06:04,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:06:04,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:06:04,835 INFO L87 Difference]: Start difference. First operand has 422 states, 398 states have (on average 1.8693467336683418) internal successors, (744), 421 states have internal predecessors, (744), 0 states have call successors, (0), 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 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:05,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:06:05,300 INFO L93 Difference]: Finished difference Result 524 states and 926 transitions. [2023-11-19 05:06:05,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:06:05,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-19 05:06:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:06:05,318 INFO L225 Difference]: With dead ends: 524 [2023-11-19 05:06:05,318 INFO L226 Difference]: Without dead ends: 510 [2023-11-19 05:06:05,319 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 [2023-11-19 05:06:05,323 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 71 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 05:06:05,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 35 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 05:06:05,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2023-11-19 05:06:05,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 450. [2023-11-19 05:06:05,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 430 states have (on average 1.8604651162790697) internal successors, (800), 449 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 800 transitions. [2023-11-19 05:06:05,402 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 800 transitions. Word has length 7 [2023-11-19 05:06:05,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:06:05,403 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 800 transitions. [2023-11-19 05:06:05,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:05,403 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 800 transitions. [2023-11-19 05:06:05,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 05:06:05,404 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:06:05,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:06:05,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:06:05,405 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 05:06:05,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:06:05,406 INFO L85 PathProgramCache]: Analyzing trace with hash 836274150, now seen corresponding path program 1 times [2023-11-19 05:06:05,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:06:05,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134613083] [2023-11-19 05:06:05,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:06:05,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:06:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:06:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:05,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:06:05,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134613083] [2023-11-19 05:06:05,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134613083] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:06:05,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:06:05,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:06:05,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770285473] [2023-11-19 05:06:05,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:06:05,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:06:05,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:06:05,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:06:05,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:06:05,768 INFO L87 Difference]: Start difference. First operand 450 states and 800 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:06:06,083 INFO L93 Difference]: Finished difference Result 619 states and 1091 transitions. [2023-11-19 05:06:06,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:06:06,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-19 05:06:06,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:06:06,091 INFO L225 Difference]: With dead ends: 619 [2023-11-19 05:06:06,093 INFO L226 Difference]: Without dead ends: 605 [2023-11-19 05:06:06,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:06:06,096 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 28 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:06:06,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 25 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:06:06,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2023-11-19 05:06:06,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 503. [2023-11-19 05:06:06,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 486 states have (on average 1.853909465020576) internal successors, (901), 502 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 901 transitions. [2023-11-19 05:06:06,157 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 901 transitions. Word has length 8 [2023-11-19 05:06:06,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:06:06,158 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 901 transitions. [2023-11-19 05:06:06,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 901 transitions. [2023-11-19 05:06:06,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 05:06:06,160 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:06:06,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:06:06,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:06:06,161 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 05:06:06,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:06:06,163 INFO L85 PathProgramCache]: Analyzing trace with hash -38167286, now seen corresponding path program 1 times [2023-11-19 05:06:06,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:06:06,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784498840] [2023-11-19 05:06:06,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:06:06,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:06:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:06:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:06,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:06:06,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784498840] [2023-11-19 05:06:06,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784498840] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:06:06,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:06:06,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:06:06,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784838081] [2023-11-19 05:06:06,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:06:06,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:06:06,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:06:06,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:06:06,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:06:06,580 INFO L87 Difference]: Start difference. First operand 503 states and 901 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) [2023-11-19 05:06:06,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:06:06,757 INFO L93 Difference]: Finished difference Result 531 states and 947 transitions. [2023-11-19 05:06:06,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:06:06,758 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 [2023-11-19 05:06:06,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:06:06,762 INFO L225 Difference]: With dead ends: 531 [2023-11-19 05:06:06,762 INFO L226 Difference]: Without dead ends: 503 [2023-11-19 05:06:06,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:06:06,763 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:06:06,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 39 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:06:06,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2023-11-19 05:06:06,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 498. [2023-11-19 05:06:06,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 482 states have (on average 1.8630705394190872) internal successors, (898), 497 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:06,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 898 transitions. [2023-11-19 05:06:06,790 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 898 transitions. Word has length 14 [2023-11-19 05:06:06,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:06:06,791 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 898 transitions. [2023-11-19 05:06:06,791 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) [2023-11-19 05:06:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 898 transitions. [2023-11-19 05:06:06,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-19 05:06:06,793 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:06:06,793 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] [2023-11-19 05:06:06,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:06:06,794 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 05:06:06,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:06:06,794 INFO L85 PathProgramCache]: Analyzing trace with hash 44893838, now seen corresponding path program 1 times [2023-11-19 05:06:06,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:06:06,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870196702] [2023-11-19 05:06:06,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:06:06,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:06:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:06:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:07,222 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:06:07,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870196702] [2023-11-19 05:06:07,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870196702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:06:07,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:06:07,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:06:07,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17979748] [2023-11-19 05:06:07,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:06:07,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:06:07,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:06:07,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:06:07,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:06:07,233 INFO L87 Difference]: Start difference. First operand 498 states and 898 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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) [2023-11-19 05:06:07,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:06:07,790 INFO L93 Difference]: Finished difference Result 650 states and 1182 transitions. [2023-11-19 05:06:07,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:06:07,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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 21 [2023-11-19 05:06:07,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:06:07,795 INFO L225 Difference]: With dead ends: 650 [2023-11-19 05:06:07,796 INFO L226 Difference]: Without dead ends: 638 [2023-11-19 05:06:07,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:06:07,797 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 88 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 05:06:07,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 65 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 05:06:07,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2023-11-19 05:06:07,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2023-11-19 05:06:07,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 622 states have (on average 1.864951768488746) internal successors, (1160), 637 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:07,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1160 transitions. [2023-11-19 05:06:07,822 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1160 transitions. Word has length 21 [2023-11-19 05:06:07,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:06:07,822 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 1160 transitions. [2023-11-19 05:06:07,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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) [2023-11-19 05:06:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1160 transitions. [2023-11-19 05:06:07,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-19 05:06:07,830 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:06:07,830 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:06:07,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 05:06:07,831 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 05:06:07,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:06:07,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1699896246, now seen corresponding path program 1 times [2023-11-19 05:06:07,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:06:07,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273765079] [2023-11-19 05:06:07,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:06:07,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:06:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:06:08,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:08,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:06:08,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273765079] [2023-11-19 05:06:08,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273765079] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:06:08,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161697602] [2023-11-19 05:06:08,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:06:08,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:06:08,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:06:08,609 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:06:08,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:06:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:06:08,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-19 05:06:08,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:06:08,838 INFO L378 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 17 treesize of output 9 [2023-11-19 05:06:08,926 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 05:06:08,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-19 05:06:09,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:06:09,009 INFO L378 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 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-19 05:06:09,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:06:09,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-19 05:06:09,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:06:09,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-19 05:06:09,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:09,198 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:06:09,245 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_200 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_200) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_200 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_200) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_200 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_200) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_200 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_200) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-19 05:06:11,424 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_200 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_200) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_200 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_200) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_200 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_200) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_200 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_200) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-19 05:06:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-19 05:06:13,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161697602] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:06:13,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2013341232] [2023-11-19 05:06:13,587 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:337) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-11-19 05:06:13,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:06:13,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2023-11-19 05:06:13,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018094360] [2023-11-19 05:06:13,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:06:13,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-19 05:06:13,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:06:13,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-19 05:06:13,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=446, Unknown=13, NotChecked=90, Total=650 [2023-11-19 05:06:13,599 INFO L87 Difference]: Start difference. First operand 638 states and 1160 transitions. Second operand has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:06:16,275 INFO L93 Difference]: Finished difference Result 659 states and 1196 transitions. [2023-11-19 05:06:16,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-19 05:06:16,275 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-19 05:06:16,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:06:16,280 INFO L225 Difference]: With dead ends: 659 [2023-11-19 05:06:16,280 INFO L226 Difference]: Without dead ends: 652 [2023-11-19 05:06:16,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=289, Invalid=966, Unknown=13, NotChecked=138, Total=1406 [2023-11-19 05:06:16,283 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 309 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 3115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 594 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:06:16,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 410 Invalid, 3115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2481 Invalid, 0 Unknown, 594 Unchecked, 2.3s Time] [2023-11-19 05:06:16,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2023-11-19 05:06:16,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 609. [2023-11-19 05:06:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 594 states have (on average 1.8585858585858586) internal successors, (1104), 608 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1104 transitions. [2023-11-19 05:06:16,310 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1104 transitions. Word has length 24 [2023-11-19 05:06:16,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:06:16,311 INFO L495 AbstractCegarLoop]: Abstraction has 609 states and 1104 transitions. [2023-11-19 05:06:16,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:16,311 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1104 transitions. [2023-11-19 05:06:16,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-19 05:06:16,315 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:06:16,316 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:06:16,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 05:06:16,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:06:16,541 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 05:06:16,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:06:16,542 INFO L85 PathProgramCache]: Analyzing trace with hash 976561849, now seen corresponding path program 1 times [2023-11-19 05:06:16,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:06:16,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116427797] [2023-11-19 05:06:16,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:06:16,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:06:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:06:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:17,096 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:06:17,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116427797] [2023-11-19 05:06:17,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116427797] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:06:17,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815521977] [2023-11-19 05:06:17,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:06:17,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:06:17,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:06:17,098 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:06:17,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 05:06:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:06:17,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-19 05:06:17,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:06:17,264 INFO L378 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 17 treesize of output 9 [2023-11-19 05:06:17,390 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 05:06:17,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:06:17,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 05:06:17,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-19 05:06:17,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:06:17,481 INFO L378 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-19 05:06:17,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:06:17,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-19 05:06:17,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:17,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:06:17,609 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_294) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) is different from false [2023-11-19 05:06:17,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:06:17,617 INFO L378 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 18 treesize of output 19 [2023-11-19 05:06:17,621 INFO L378 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 30 treesize of output 22 [2023-11-19 05:06:17,624 INFO L378 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 5 treesize of output 3 [2023-11-19 05:06:17,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:17,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815521977] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:06:17,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1469171476] [2023-11-19 05:06:17,711 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:337) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-11-19 05:06:17,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:06:17,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2023-11-19 05:06:17,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173840820] [2023-11-19 05:06:17,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:06:17,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-19 05:06:17,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:06:17,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-19 05:06:17,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=467, Unknown=1, NotChecked=44, Total=600 [2023-11-19 05:06:17,715 INFO L87 Difference]: Start difference. First operand 609 states and 1104 transitions. Second operand has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 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) [2023-11-19 05:06:18,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:06:18,582 INFO L93 Difference]: Finished difference Result 595 states and 1075 transitions. [2023-11-19 05:06:18,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 05:06:18,583 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 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 24 [2023-11-19 05:06:18,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:06:18,588 INFO L225 Difference]: With dead ends: 595 [2023-11-19 05:06:18,588 INFO L226 Difference]: Without dead ends: 582 [2023-11-19 05:06:18,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=875, Unknown=1, NotChecked=64, Total=1190 [2023-11-19 05:06:18,589 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 381 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 05:06:18,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 39 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 631 Invalid, 0 Unknown, 113 Unchecked, 0.6s Time] [2023-11-19 05:06:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2023-11-19 05:06:18,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 534. [2023-11-19 05:06:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 522 states have (on average 1.842911877394636) internal successors, (962), 533 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 962 transitions. [2023-11-19 05:06:18,612 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 962 transitions. Word has length 24 [2023-11-19 05:06:18,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:06:18,613 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 962 transitions. [2023-11-19 05:06:18,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 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) [2023-11-19 05:06:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 962 transitions. [2023-11-19 05:06:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-19 05:06:18,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:06:18,614 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] [2023-11-19 05:06:18,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-19 05:06:18,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-19 05:06:18,828 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 05:06:18,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:06:18,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1157963347, now seen corresponding path program 1 times [2023-11-19 05:06:18,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:06:18,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639832173] [2023-11-19 05:06:18,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:06:18,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:06:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:06:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:18,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:06:18,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639832173] [2023-11-19 05:06:18,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639832173] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:06:18,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534130137] [2023-11-19 05:06:18,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:06:18,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:06:18,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:06:18,940 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:06:18,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 05:06:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:06:19,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-19 05:06:19,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:06:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:19,107 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:06:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:19,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534130137] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:06:19,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [525817522] [2023-11-19 05:06:19,159 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:337) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-11-19 05:06:19,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:06:19,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-11-19 05:06:19,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136058427] [2023-11-19 05:06:19,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:06:19,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 05:06:19,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:06:19,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 05:06:19,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:06:19,164 INFO L87 Difference]: Start difference. First operand 534 states and 962 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 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) [2023-11-19 05:06:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:06:19,218 INFO L93 Difference]: Finished difference Result 388 states and 696 transitions. [2023-11-19 05:06:19,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:06:19,218 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 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 25 [2023-11-19 05:06:19,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:06:19,225 INFO L225 Difference]: With dead ends: 388 [2023-11-19 05:06:19,225 INFO L226 Difference]: Without dead ends: 388 [2023-11-19 05:06:19,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:06:19,227 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 85 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:06:19,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 54 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:06:19,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-11-19 05:06:19,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2023-11-19 05:06:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 379 states have (on average 1.8364116094986807) internal successors, (696), 387 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:19,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 696 transitions. [2023-11-19 05:06:19,240 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 696 transitions. Word has length 25 [2023-11-19 05:06:19,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:06:19,241 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 696 transitions. [2023-11-19 05:06:19,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 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) [2023-11-19 05:06:19,241 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 696 transitions. [2023-11-19 05:06:19,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-19 05:06:19,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:06:19,242 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] [2023-11-19 05:06:19,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 05:06:19,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:06:19,456 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 05:06:19,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:06:19,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1157935261, now seen corresponding path program 1 times [2023-11-19 05:06:19,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:06:19,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456595422] [2023-11-19 05:06:19,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:06:19,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:06:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:06:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:19,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:06:19,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456595422] [2023-11-19 05:06:19,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456595422] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:06:19,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509818093] [2023-11-19 05:06:19,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:06:19,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:06:19,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:06:19,968 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:06:19,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 05:06:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:06:20,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-19 05:06:20,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:06:20,138 INFO L378 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 17 treesize of output 9 [2023-11-19 05:06:20,285 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 05:06:20,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-19 05:06:20,364 INFO L378 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 26 treesize of output 28 [2023-11-19 05:06:20,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-19 05:06:20,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:06:20,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-19 05:06:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:20,606 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:06:20,642 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_489 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_489) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_489) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_489) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_489) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-19 05:06:22,810 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_489) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_489) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_489) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_489) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-19 05:06:24,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-19 05:06:24,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509818093] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:06:24,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [736833000] [2023-11-19 05:06:24,970 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java: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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:337) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-11-19 05:06:24,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:06:24,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2023-11-19 05:06:24,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147215650] [2023-11-19 05:06:24,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:06:24,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-19 05:06:24,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:06:24,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-19 05:06:24,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=492, Unknown=11, NotChecked=94, Total=702 [2023-11-19 05:06:24,973 INFO L87 Difference]: Start difference. First operand 388 states and 696 transitions. Second operand has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:26,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:06:26,616 INFO L93 Difference]: Finished difference Result 444 states and 804 transitions. [2023-11-19 05:06:26,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 05:06:26,617 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-19 05:06:26,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:06:26,620 INFO L225 Difference]: With dead ends: 444 [2023-11-19 05:06:26,620 INFO L226 Difference]: Without dead ends: 444 [2023-11-19 05:06:26,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=295, Invalid=1034, Unknown=11, NotChecked=142, Total=1482 [2023-11-19 05:06:26,622 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 228 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 413 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:06:26,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 193 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1468 Invalid, 0 Unknown, 413 Unchecked, 1.2s Time] [2023-11-19 05:06:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2023-11-19 05:06:26,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 374. [2023-11-19 05:06:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 366 states have (on average 1.830601092896175) internal successors, (670), 373 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 670 transitions. [2023-11-19 05:06:26,634 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 670 transitions. Word has length 25 [2023-11-19 05:06:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:06:26,635 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 670 transitions. [2023-11-19 05:06:26,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:26,635 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 670 transitions. [2023-11-19 05:06:26,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-19 05:06:26,636 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:06:26,636 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] [2023-11-19 05:06:26,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 05:06:26,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:06:26,857 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 05:06:26,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:06:26,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1163642941, now seen corresponding path program 1 times [2023-11-19 05:06:26,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:06:26,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996134511] [2023-11-19 05:06:26,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:06:26,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:06:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:06:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:27,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:06:27,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996134511] [2023-11-19 05:06:27,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996134511] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:06:27,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872112096] [2023-11-19 05:06:27,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:06:27,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:06:27,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:06:27,331 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:06:27,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 05:06:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:06:27,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-19 05:06:27,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:06:27,501 INFO L378 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 17 treesize of output 9 [2023-11-19 05:06:27,625 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 05:06:27,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:06:27,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 05:06:27,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-19 05:06:27,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:06:27,720 INFO L378 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-19 05:06:27,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:06:27,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-19 05:06:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:27,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:06:28,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:06:28,956 INFO L378 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 18 treesize of output 19 [2023-11-19 05:06:28,958 INFO L378 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 30 treesize of output 22 [2023-11-19 05:06:28,962 INFO L378 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 5 treesize of output 3 [2023-11-19 05:06:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:29,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872112096] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:06:29,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [440651100] [2023-11-19 05:06:29,063 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:337) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-11-19 05:06:29,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:06:29,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2023-11-19 05:06:29,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988303715] [2023-11-19 05:06:29,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:06:29,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-19 05:06:29,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:06:29,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-19 05:06:29,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=500, Unknown=10, NotChecked=0, Total=600 [2023-11-19 05:06:29,065 INFO L87 Difference]: Start difference. First operand 374 states and 670 transitions. Second operand has 25 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:29,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:06:29,781 INFO L93 Difference]: Finished difference Result 360 states and 644 transitions. [2023-11-19 05:06:29,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 05:06:29,781 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-19 05:06:29,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:06:29,784 INFO L225 Difference]: With dead ends: 360 [2023-11-19 05:06:29,784 INFO L226 Difference]: Without dead ends: 356 [2023-11-19 05:06:29,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=254, Invalid=926, Unknown=10, NotChecked=0, Total=1190 [2023-11-19 05:06:29,785 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 215 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 05:06:29,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 41 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 05:06:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-11-19 05:06:29,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 304. [2023-11-19 05:06:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 299 states have (on average 1.8093645484949832) internal successors, (541), 303 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:29,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 541 transitions. [2023-11-19 05:06:29,795 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 541 transitions. Word has length 25 [2023-11-19 05:06:29,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:06:29,796 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 541 transitions. [2023-11-19 05:06:29,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:29,796 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 541 transitions. [2023-11-19 05:06:29,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-19 05:06:29,797 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:06:29,797 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:06:29,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-19 05:06:30,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-19 05:06:30,012 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 05:06:30,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:06:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1872086443, now seen corresponding path program 2 times [2023-11-19 05:06:30,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:06:30,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672402102] [2023-11-19 05:06:30,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:06:30,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:06:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:06:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:30,761 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:06:30,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672402102] [2023-11-19 05:06:30,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672402102] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:06:30,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753036894] [2023-11-19 05:06:30,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 05:06:30,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:06:30,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:06:30,762 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:06:30,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-19 05:06:30,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-19 05:06:30,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:06:30,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-19 05:06:30,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:06:30,965 INFO L378 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 26 treesize of output 14 [2023-11-19 05:06:30,967 INFO L378 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 7 treesize of output 3 [2023-11-19 05:06:31,183 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 05:06:31,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-19 05:06:31,283 INFO L378 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 26 treesize of output 28 [2023-11-19 05:06:31,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-19 05:06:31,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:06:31,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-19 05:06:31,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:06:31,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-19 05:06:31,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:06:31,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-19 05:06:31,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:06:31,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-19 05:06:31,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:06:31,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-19 05:06:31,702 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:31,703 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:06:31,730 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_709 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_709) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_709 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_709) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_709 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_709) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_709 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_709) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3))))) is different from false [2023-11-19 05:06:31,774 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_708 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_709) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_708 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_709) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_708 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_709) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_708 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_709) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-19 05:06:31,873 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_708 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_709) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_708 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_709) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_708 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_709) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_708 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_709) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-19 05:06:31,899 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_708 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_709) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_708 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_709) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_708 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_709) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_708 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_709) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-19 05:06:32,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-19 05:06:32,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753036894] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:06:32,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1308047008] [2023-11-19 05:06:32,153 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:337) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-11-19 05:06:32,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:06:32,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2023-11-19 05:06:32,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026407220] [2023-11-19 05:06:32,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:06:32,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-19 05:06:32,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:06:32,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-19 05:06:32,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=548, Unknown=4, NotChecked=204, Total=870 [2023-11-19 05:06:32,157 INFO L87 Difference]: Start difference. First operand 304 states and 541 transitions. Second operand has 30 states, 29 states have (on average 3.0344827586206895) internal successors, (88), 29 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:06:33,843 INFO L93 Difference]: Finished difference Result 297 states and 528 transitions. [2023-11-19 05:06:33,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 05:06:33,844 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.0344827586206895) internal successors, (88), 29 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-19 05:06:33,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:06:33,846 INFO L225 Difference]: With dead ends: 297 [2023-11-19 05:06:33,846 INFO L226 Difference]: Without dead ends: 297 [2023-11-19 05:06:33,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=304, Invalid=1114, Unknown=4, NotChecked=300, Total=1722 [2023-11-19 05:06:33,847 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 238 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 2230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 786 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:06:33,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 187 Invalid, 2230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1376 Invalid, 0 Unknown, 786 Unchecked, 1.1s Time] [2023-11-19 05:06:33,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-11-19 05:06:33,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 257. [2023-11-19 05:06:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 253 states have (on average 1.7865612648221343) internal successors, (452), 256 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 452 transitions. [2023-11-19 05:06:33,859 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 452 transitions. Word has length 30 [2023-11-19 05:06:33,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:06:33,861 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 452 transitions. [2023-11-19 05:06:33,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.0344827586206895) internal successors, (88), 29 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:06:33,862 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 452 transitions. [2023-11-19 05:06:33,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-19 05:06:33,863 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:06:33,863 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2023-11-19 05:06:33,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-19 05:06:34,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a652b3fa-54d0-403f-a3cd-98313b509d96/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-19 05:06:34,080 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-19 05:06:34,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:06:34,080 INFO L85 PathProgramCache]: Analyzing trace with hash 280364343, now seen corresponding path program 1 times [2023-11-19 05:06:34,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:06:34,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725422462] [2023-11-19 05:06:34,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:06:34,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:06:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 05:06:34,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 05:06:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 05:06:34,216 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 05:06:34,216 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 05:06:34,217 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2023-11-19 05:06:34,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2023-11-19 05:06:34,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2023-11-19 05:06:34,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2023-11-19 05:06:34,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2023-11-19 05:06:34,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2023-11-19 05:06:34,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2023-11-19 05:06:34,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2023-11-19 05:06:34,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2023-11-19 05:06:34,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 05:06:34,226 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:06:34,228 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 05:06:34,229 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-19 05:06:34,264 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-19 05:06:34,269 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 05:06:34,269 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 140 transitions, 296 flow [2023-11-19 05:06:34,270 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 140 transitions, 296 flow [2023-11-19 05:06:34,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 140 transitions, 296 flow [2023-11-19 05:06:34,373 INFO L124 PetriNetUnfolderBase]: 11/335 cut-off events. [2023-11-19 05:06:34,374 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-19 05:06:34,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 335 events. 11/335 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 762 event pairs, 0 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 190. Up to 8 conditions per place. [2023-11-19 05:06:34,384 INFO L119 LiptonReduction]: Number of co-enabled transitions 5664