./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/05-lval_ls_13-idxunknown_lock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/05-lval_ls_13-idxunknown_lock.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje --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 88789d38e839cdb13726f2ad9aa669b066ca22f31157bd019778c09c91261c6f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:15:45,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:15:45,288 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DataRace-32bit-Taipan_Default.epf [2024-11-09 01:15:45,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:15:45,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:15:45,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:15:45,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:15:45,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:15:45,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:15:45,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:15:45,321 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:15:45,321 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:15:45,322 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:15:45,322 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 01:15:45,322 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:15:45,323 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:15:45,323 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 01:15:45,326 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 01:15:45,326 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:15:45,326 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 01:15:45,327 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 01:15:45,331 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 01:15:45,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:15:45,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:15:45,332 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:15:45,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:15:45,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:15:45,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:15:45,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:15:45,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:15:45,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:15:45,334 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 01:15:45,334 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:15:45,335 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 01:15:45,335 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:15:45,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:15:45,335 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:15:45,336 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:15:45,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:15:45,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:15:45,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:15:45,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:15:45,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:15:45,342 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 01:15:45,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:15:45,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:15:45,343 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:15:45,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:15:45,343 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_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/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_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje 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 -> 88789d38e839cdb13726f2ad9aa669b066ca22f31157bd019778c09c91261c6f [2024-11-09 01:15:45,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:15:45,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:15:45,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:15:45,679 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:15:45,680 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:15:45,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/goblint-regression/05-lval_ls_13-idxunknown_lock.i Unable to find full path for "g++" [2024-11-09 01:15:47,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:15:48,034 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:15:48,035 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/sv-benchmarks/c/goblint-regression/05-lval_ls_13-idxunknown_lock.i [2024-11-09 01:15:48,053 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/data/33bce0d15/c33e026e64c1459db4ffe23b1080232b/FLAG9c27e1bee [2024-11-09 01:15:48,072 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/data/33bce0d15/c33e026e64c1459db4ffe23b1080232b [2024-11-09 01:15:48,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:15:48,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:15:48,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:15:48,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:15:48,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:15:48,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:15:48" (1/1) ... [2024-11-09 01:15:48,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f77bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:48, skipping insertion in model container [2024-11-09 01:15:48,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:15:48" (1/1) ... [2024-11-09 01:15:48,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:15:48,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:15:48,688 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:15:48,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:15:48,801 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:15:48,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:48 WrapperNode [2024-11-09 01:15:48,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:15:48,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:15:48,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:15:48,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:15:48,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:48" (1/1) ... [2024-11-09 01:15:48,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:48" (1/1) ... [2024-11-09 01:15:48,856 INFO L138 Inliner]: procedures = 165, calls = 74, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 117 [2024-11-09 01:15:48,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:15:48,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:15:48,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:15:48,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:15:48,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:48" (1/1) ... [2024-11-09 01:15:48,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:48" (1/1) ... [2024-11-09 01:15:48,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:48" (1/1) ... [2024-11-09 01:15:48,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:48" (1/1) ... [2024-11-09 01:15:48,893 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:48" (1/1) ... [2024-11-09 01:15:48,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:48" (1/1) ... [2024-11-09 01:15:48,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:48" (1/1) ... [2024-11-09 01:15:48,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:48" (1/1) ... [2024-11-09 01:15:48,903 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:15:48,905 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:15:48,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:15:48,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:15:48,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:48" (1/1) ... [2024-11-09 01:15:48,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:15:48,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:15:48,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:15:48,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:15:48,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 01:15:48,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 01:15:48,985 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 01:15:48,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:15:48,985 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 01:15:48,985 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 01:15:48,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:15:48,986 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 01:15:48,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:15:48,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:15:48,988 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 01:15:49,125 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:15:49,128 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:15:49,511 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 01:15:49,512 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:15:49,545 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:15:49,546 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 01:15:49,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:15:49 BoogieIcfgContainer [2024-11-09 01:15:49,548 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:15:49,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:15:49,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:15:49,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:15:49,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:15:48" (1/3) ... [2024-11-09 01:15:49,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7057ad5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:15:49, skipping insertion in model container [2024-11-09 01:15:49,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:48" (2/3) ... [2024-11-09 01:15:49,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7057ad5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:15:49, skipping insertion in model container [2024-11-09 01:15:49,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:15:49" (3/3) ... [2024-11-09 01:15:49,561 INFO L112 eAbstractionObserver]: Analyzing ICFG 05-lval_ls_13-idxunknown_lock.i [2024-11-09 01:15:49,581 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:15:49,581 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 01:15:49,581 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 01:15:49,671 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 01:15:49,713 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 152 places, 151 transitions, 306 flow [2024-11-09 01:15:49,817 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 822 states, 814 states have (on average 1.8402948402948403) internal successors, (1498), 821 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:49,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:15:49,859 INFO L333 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, 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;@75550a4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:15:49,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 01:15:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand has 822 states, 814 states have (on average 1.8402948402948403) internal successors, (1498), 821 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:49,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 01:15:49,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:15:49,874 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:15:49,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 01:15:49,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:15:49,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1217205726, now seen corresponding path program 1 times [2024-11-09 01:15:49,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:15:49,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027925078] [2024-11-09 01:15:49,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:49,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:15:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:50,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:15:50,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027925078] [2024-11-09 01:15:50,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027925078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:15:50,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:15:50,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:15:50,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450633865] [2024-11-09 01:15:50,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:15:50,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:15:50,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:15:50,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:15:50,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:15:50,542 INFO L87 Difference]: Start difference. First operand has 822 states, 814 states have (on average 1.8402948402948403) internal successors, (1498), 821 states have internal predecessors, (1498), 0 states have call successors, (0), 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 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:50,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:15:50,693 INFO L93 Difference]: Finished difference Result 1574 states and 2926 transitions. [2024-11-09 01:15:50,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:15:50,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-09 01:15:50,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:15:50,730 INFO L225 Difference]: With dead ends: 1574 [2024-11-09 01:15:50,730 INFO L226 Difference]: Without dead ends: 826 [2024-11-09 01:15:50,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:15:50,741 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 4 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:15:50,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 273 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:15:50,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2024-11-09 01:15:50,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 823. [2024-11-09 01:15:50,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 815 states have (on average 1.838036809815951) internal successors, (1498), 822 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:50,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1498 transitions. [2024-11-09 01:15:50,842 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1498 transitions. Word has length 95 [2024-11-09 01:15:50,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:15:50,843 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1498 transitions. [2024-11-09 01:15:50,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:50,843 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1498 transitions. [2024-11-09 01:15:50,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 01:15:50,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:15:50,847 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:15:50,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:15:50,847 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 01:15:50,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:15:50,849 INFO L85 PathProgramCache]: Analyzing trace with hash 486095201, now seen corresponding path program 1 times [2024-11-09 01:15:50,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:15:50,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896360035] [2024-11-09 01:15:50,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:50,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:15:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:51,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:15:51,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896360035] [2024-11-09 01:15:51,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896360035] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:15:51,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294066714] [2024-11-09 01:15:51,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:51,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:15:51,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:15:51,161 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:15:51,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:15:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:51,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:15:51,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:15:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:51,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:15:51,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:51,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294066714] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:15:51,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1188182045] [2024-11-09 01:15:51,593 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) 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:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-09 01:15:51,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:15:51,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 01:15:51,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793748943] [2024-11-09 01:15:51,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:15:51,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:15:51,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:15:51,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:15:51,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:15:51,602 INFO L87 Difference]: Start difference. First operand 823 states and 1498 transitions. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:51,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:15:51,768 INFO L93 Difference]: Finished difference Result 1580 states and 2931 transitions. [2024-11-09 01:15:51,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:15:51,769 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-11-09 01:15:51,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:15:51,776 INFO L225 Difference]: With dead ends: 1580 [2024-11-09 01:15:51,776 INFO L226 Difference]: Without dead ends: 834 [2024-11-09 01:15:51,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:15:51,781 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 14 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:15:51,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 668 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:15:51,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-11-09 01:15:51,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 834. [2024-11-09 01:15:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 826 states have (on average 1.8256658595641646) internal successors, (1508), 833 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1508 transitions. [2024-11-09 01:15:51,829 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1508 transitions. Word has length 101 [2024-11-09 01:15:51,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:15:51,830 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1508 transitions. [2024-11-09 01:15:51,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1508 transitions. [2024-11-09 01:15:51,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 01:15:51,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:15:51,835 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:15:51,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 01:15:52,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:15:52,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 01:15:52,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:15:52,041 INFO L85 PathProgramCache]: Analyzing trace with hash 95118759, now seen corresponding path program 2 times [2024-11-09 01:15:52,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:15:52,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785064208] [2024-11-09 01:15:52,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:52,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:15:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:52,359 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:52,360 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:15:52,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785064208] [2024-11-09 01:15:52,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785064208] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:15:52,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043538441] [2024-11-09 01:15:52,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 01:15:52,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:15:52,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:15:52,363 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:15:52,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:15:52,513 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 01:15:52,513 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:15:52,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 01:15:52,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:15:52,832 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 [2024-11-09 01:15:52,868 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 [2024-11-09 01:15:52,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:15:52,939 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 [2024-11-09 01:15:53,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:15:53,017 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 [2024-11-09 01:15:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 01:15:53,072 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:15:53,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043538441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:15:53,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:15:53,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2024-11-09 01:15:53,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087409472] [2024-11-09 01:15:53,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:15:53,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:15:53,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:15:53,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:15:53,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:15:53,076 INFO L87 Difference]: Start difference. First operand 834 states and 1508 transitions. Second operand has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:53,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:15:53,615 INFO L93 Difference]: Finished difference Result 1288 states and 2372 transitions. [2024-11-09 01:15:53,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:15:53,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-11-09 01:15:53,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:15:53,626 INFO L225 Difference]: With dead ends: 1288 [2024-11-09 01:15:53,627 INFO L226 Difference]: Without dead ends: 1232 [2024-11-09 01:15:53,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:15:53,629 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 227 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:15:53,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 441 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:15:53,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2024-11-09 01:15:53,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 936. [2024-11-09 01:15:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 929 states have (on average 1.8471474703982778) internal successors, (1716), 935 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1716 transitions. [2024-11-09 01:15:53,676 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1716 transitions. Word has length 113 [2024-11-09 01:15:53,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:15:53,680 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1716 transitions. [2024-11-09 01:15:53,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:53,682 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1716 transitions. [2024-11-09 01:15:53,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 01:15:53,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:15:53,688 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:15:53,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 01:15:53,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:15:53,889 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 01:15:53,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:15:53,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1077428140, now seen corresponding path program 1 times [2024-11-09 01:15:53,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:15:53,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627305762] [2024-11-09 01:15:53,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:53,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:15:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:54,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:15:54,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627305762] [2024-11-09 01:15:54,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627305762] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:15:54,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940488870] [2024-11-09 01:15:54,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:54,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:15:54,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:15:54,218 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:15:54,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 01:15:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:54,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:15:54,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:15:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:54,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:15:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:54,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940488870] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:15:54,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1657838573] [2024-11-09 01:15:54,592 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) 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:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-09 01:15:54,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:15:54,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-09 01:15:54,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649772765] [2024-11-09 01:15:54,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:15:54,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 01:15:54,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:15:54,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 01:15:54,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:15:54,599 INFO L87 Difference]: Start difference. First operand 936 states and 1716 transitions. Second operand has 18 states, 18 states have (on average 8.166666666666666) internal successors, (147), 18 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:54,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:15:54,901 INFO L93 Difference]: Finished difference Result 1808 states and 3371 transitions. [2024-11-09 01:15:54,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 01:15:54,903 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.166666666666666) internal successors, (147), 18 states have internal predecessors, (147), 0 states have call successors, (0), 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 121 [2024-11-09 01:15:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:15:54,911 INFO L225 Difference]: With dead ends: 1808 [2024-11-09 01:15:54,911 INFO L226 Difference]: Without dead ends: 960 [2024-11-09 01:15:54,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2024-11-09 01:15:54,915 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 29 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:15:54,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 943 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:15:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-09 01:15:54,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2024-11-09 01:15:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 953 states have (on average 1.825813221406086) internal successors, (1740), 959 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:54,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1740 transitions. [2024-11-09 01:15:54,950 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1740 transitions. Word has length 121 [2024-11-09 01:15:54,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:15:54,951 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1740 transitions. [2024-11-09 01:15:54,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.166666666666666) internal successors, (147), 18 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:54,951 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1740 transitions. [2024-11-09 01:15:54,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 01:15:54,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:15:54,953 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2024-11-09 01:15:54,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 01:15:55,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:15:55,155 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 01:15:55,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:15:55,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1242619592, now seen corresponding path program 2 times [2024-11-09 01:15:55,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:15:55,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338255603] [2024-11-09 01:15:55,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:55,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:15:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:55,716 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:55,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:15:55,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338255603] [2024-11-09 01:15:55,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338255603] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:15:55,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248024751] [2024-11-09 01:15:55,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 01:15:55,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:15:55,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:15:55,720 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:15:55,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 01:15:55,862 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 01:15:55,862 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:15:55,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:15:55,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:15:56,184 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 [2024-11-09 01:15:56,230 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 [2024-11-09 01:15:56,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:15:56,285 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 [2024-11-09 01:15:56,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:15:56,363 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 [2024-11-09 01:15:56,424 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2024-11-09 01:15:56,425 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:15:56,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248024751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:15:56,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:15:56,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 22 [2024-11-09 01:15:56,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036625395] [2024-11-09 01:15:56,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:15:56,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:15:56,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:15:56,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:15:56,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2024-11-09 01:15:56,428 INFO L87 Difference]: Start difference. First operand 960 states and 1740 transitions. Second operand has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:56,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:15:56,846 INFO L93 Difference]: Finished difference Result 1291 states and 2347 transitions. [2024-11-09 01:15:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:15:56,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2024-11-09 01:15:56,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:15:56,856 INFO L225 Difference]: With dead ends: 1291 [2024-11-09 01:15:56,856 INFO L226 Difference]: Without dead ends: 1057 [2024-11-09 01:15:56,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2024-11-09 01:15:56,859 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 130 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:15:56,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 507 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:15:56,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2024-11-09 01:15:56,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 880. [2024-11-09 01:15:56,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 873 states have (on average 1.7938144329896908) internal successors, (1566), 879 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1566 transitions. [2024-11-09 01:15:56,895 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1566 transitions. Word has length 145 [2024-11-09 01:15:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:15:56,896 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1566 transitions. [2024-11-09 01:15:56,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1566 transitions. [2024-11-09 01:15:56,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 01:15:56,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:15:56,901 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:15:56,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 01:15:57,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:15:57,105 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 01:15:57,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:15:57,106 INFO L85 PathProgramCache]: Analyzing trace with hash -329876418, now seen corresponding path program 1 times [2024-11-09 01:15:57,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:15:57,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475793846] [2024-11-09 01:15:57,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:57,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:15:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:57,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:15:57,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475793846] [2024-11-09 01:15:57,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475793846] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:15:57,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394361640] [2024-11-09 01:15:57,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:57,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:15:57,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:15:57,644 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:15:57,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 01:15:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:57,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 01:15:57,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:15:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:57,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:15:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:58,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394361640] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:15:58,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1870621687] [2024-11-09 01:15:58,190 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) 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:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-09 01:15:58,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:15:58,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2024-11-09 01:15:58,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836057917] [2024-11-09 01:15:58,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:15:58,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 01:15:58,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:15:58,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 01:15:58,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-11-09 01:15:58,194 INFO L87 Difference]: Start difference. First operand 880 states and 1566 transitions. Second operand has 23 states, 23 states have (on average 7.217391304347826) internal successors, (166), 23 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:58,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:15:58,641 INFO L93 Difference]: Finished difference Result 1666 states and 3040 transitions. [2024-11-09 01:15:58,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-09 01:15:58,642 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.217391304347826) internal successors, (166), 23 states have internal predecessors, (166), 0 states have call successors, (0), 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 146 [2024-11-09 01:15:58,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:15:58,649 INFO L225 Difference]: With dead ends: 1666 [2024-11-09 01:15:58,650 INFO L226 Difference]: Without dead ends: 898 [2024-11-09 01:15:58,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 275 SyntacticMatches, 11 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 01:15:58,655 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 41 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:15:58,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1073 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:15:58,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-11-09 01:15:58,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 898. [2024-11-09 01:15:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 891 states have (on average 1.7777777777777777) internal successors, (1584), 897 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1584 transitions. [2024-11-09 01:15:58,707 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1584 transitions. Word has length 146 [2024-11-09 01:15:58,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:15:58,707 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1584 transitions. [2024-11-09 01:15:58,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.217391304347826) internal successors, (166), 23 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:58,708 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1584 transitions. [2024-11-09 01:15:58,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-09 01:15:58,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:15:58,710 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:15:58,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 01:15:58,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:15:58,915 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 01:15:58,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:15:58,916 INFO L85 PathProgramCache]: Analyzing trace with hash -47382059, now seen corresponding path program 2 times [2024-11-09 01:15:58,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:15:58,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845698149] [2024-11-09 01:15:58,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:58,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:15:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:59,815 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 01:15:59,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:15:59,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845698149] [2024-11-09 01:15:59,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845698149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:15:59,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:15:59,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:15:59,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541576428] [2024-11-09 01:15:59,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:15:59,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:15:59,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:15:59,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:15:59,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:15:59,821 INFO L87 Difference]: Start difference. First operand 898 states and 1584 transitions. Second operand has 6 states, 5 states have (on average 22.0) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:16:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:00,140 INFO L93 Difference]: Finished difference Result 1140 states and 1997 transitions. [2024-11-09 01:16:00,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:16:00,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.0) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 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 164 [2024-11-09 01:16:00,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:00,149 INFO L225 Difference]: With dead ends: 1140 [2024-11-09 01:16:00,149 INFO L226 Difference]: Without dead ends: 937 [2024-11-09 01:16:00,151 INFO L431 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 [2024-11-09 01:16:00,151 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 95 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:00,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 306 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:16:00,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2024-11-09 01:16:00,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 819. [2024-11-09 01:16:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 812 states have (on average 1.7241379310344827) internal successors, (1400), 818 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:16:00,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1400 transitions. [2024-11-09 01:16:00,183 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1400 transitions. Word has length 164 [2024-11-09 01:16:00,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:00,184 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1400 transitions. [2024-11-09 01:16:00,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.0) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:16:00,185 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1400 transitions. [2024-11-09 01:16:00,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 01:16:00,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:00,187 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:16:00,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:16:00,188 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 01:16:00,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:00,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1060566133, now seen corresponding path program 1 times [2024-11-09 01:16:00,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:16:00,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696022414] [2024-11-09 01:16:00,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:00,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:16:00,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:16:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:16:00,356 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 01:16:00,357 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:16:00,358 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2024-11-09 01:16:00,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-09 01:16:00,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-09 01:16:00,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-09 01:16:00,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-09 01:16:00,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-09 01:16:00,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-11-09 01:16:00,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:16:00,366 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1] [2024-11-09 01:16:00,466 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 01:16:00,467 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:16:00,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:16:00 BasicIcfg [2024-11-09 01:16:00,470 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:16:00,471 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:16:00,471 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:16:00,471 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:16:00,472 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:15:49" (3/4) ... [2024-11-09 01:16:00,473 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 01:16:00,552 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/witness.graphml [2024-11-09 01:16:00,552 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:16:00,553 INFO L158 Benchmark]: Toolchain (without parser) took 12475.88ms. Allocated memory was 153.1MB in the beginning and 272.6MB in the end (delta: 119.5MB). Free memory was 118.6MB in the beginning and 139.8MB in the end (delta: -21.1MB). Peak memory consumption was 99.4MB. Max. memory is 16.1GB. [2024-11-09 01:16:00,553 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 115.3MB. Free memory is still 84.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:16:00,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 723.23ms. Allocated memory is still 153.1MB. Free memory was 118.6MB in the beginning and 108.5MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 01:16:00,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.39ms. Allocated memory is still 153.1MB. Free memory was 107.5MB in the beginning and 105.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:16:00,554 INFO L158 Benchmark]: Boogie Preprocessor took 46.11ms. Allocated memory is still 153.1MB. Free memory was 105.4MB in the beginning and 103.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:16:00,554 INFO L158 Benchmark]: RCFGBuilder took 643.68ms. Allocated memory is still 153.1MB. Free memory was 103.3MB in the beginning and 82.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 01:16:00,555 INFO L158 Benchmark]: TraceAbstraction took 10919.16ms. Allocated memory was 153.1MB in the beginning and 272.6MB in the end (delta: 119.5MB). Free memory was 81.2MB in the beginning and 148.1MB in the end (delta: -66.9MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. [2024-11-09 01:16:00,555 INFO L158 Benchmark]: Witness Printer took 81.49ms. Allocated memory is still 272.6MB. Free memory was 148.1MB in the beginning and 139.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 01:16:00,561 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 115.3MB. Free memory is still 84.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 723.23ms. Allocated memory is still 153.1MB. Free memory was 118.6MB in the beginning and 108.5MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.39ms. Allocated memory is still 153.1MB. Free memory was 107.5MB in the beginning and 105.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.11ms. Allocated memory is still 153.1MB. Free memory was 105.4MB in the beginning and 103.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 643.68ms. Allocated memory is still 153.1MB. Free memory was 103.3MB in the beginning and 82.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10919.16ms. Allocated memory was 153.1MB in the beginning and 272.6MB in the end (delta: 119.5MB). Free memory was 81.2MB in the beginning and 148.1MB in the end (delta: -66.9MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. * Witness Printer took 81.49ms. Allocated memory is still 272.6MB. Free memory was 148.1MB in the beginning and 139.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 700]: Data race detected Data race detected The following path leads to a data race: [L684] 0 int data[10]; VAL [data={1:0}] [L685] 0 pthread_mutex_t m[10]; VAL [data={1:0}, m={2:0}] [L693] 0 int i = 0; VAL [data={1:0}, i=0, m={2:0}] [L693] COND FALSE 0 !(i < 10) VAL [data={1:0}, i=0, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, i=0, m={2:0}] [L693] 0 i++ VAL [data={1:0}, i=1, m={2:0}] [L693] COND FALSE 0 !(i < 10) VAL [data={1:0}, i=1, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, i=1, m={2:0}] [L693] 0 i++ VAL [data={1:0}, i=2, m={2:0}] [L693] COND FALSE 0 !(i < 10) VAL [data={1:0}, i=2, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, i=2, m={2:0}] [L693] 0 i++ VAL [data={1:0}, i=3, m={2:0}] [L693] COND FALSE 0 !(i < 10) VAL [data={1:0}, i=3, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, i=3, m={2:0}] [L693] 0 i++ VAL [data={1:0}, i=4, m={2:0}] [L693] COND FALSE 0 !(i < 10) VAL [data={1:0}, i=4, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, i=4, m={2:0}] [L693] 0 i++ VAL [data={1:0}, i=5, m={2:0}] [L693] COND FALSE 0 !(i < 10) VAL [data={1:0}, i=5, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, i=5, m={2:0}] [L693] 0 i++ VAL [data={1:0}, i=6, m={2:0}] [L693] COND FALSE 0 !(i < 10) VAL [data={1:0}, i=6, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, i=6, m={2:0}] [L693] 0 i++ VAL [data={1:0}, i=7, m={2:0}] [L693] COND FALSE 0 !(i < 10) VAL [data={1:0}, i=7, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, i=7, m={2:0}] [L693] 0 i++ VAL [data={1:0}, i=8, m={2:0}] [L693] COND FALSE 0 !(i < 10) VAL [data={1:0}, i=8, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, i=8, m={2:0}] [L693] 0 i++ VAL [data={1:0}, i=9, m={2:0}] [L693] COND FALSE 0 !(i < 10) VAL [data={1:0}, i=9, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, i=9, m={2:0}] [L693] 0 i++ VAL [data={1:0}, i=10, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, i=10, m={2:0}] [L695] 0 int i = __VERIFIER_nondet_int(); VAL [data={1:0}, i=9, m={2:0}] [L696] CALL 0 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data={1:0}, m={2:0}] [L696] RET 0 assume_abort_if_not(0 <= i && i < 10) [L697] 0 pthread_t id; VAL [data={1:0}, i=9, m={2:0}] [L698] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, data={1:0}, i=9, id=-1, m={2:0}] [L688] EXPR 1 data[4] VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L688] 1 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L700] EXPR 0 data[4] VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, i=9, id=-1, m={2:0}] [L700] 0 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, i=9, id=-1, m={2:0}] [L688] 1 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L700] 0 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, i=9, id=-1, m={2:0}] Now there is a data race (on the heap) between C: data[4]++ [688] and C: data[4]++ [700] - UnprovableResult [Line: 700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 177 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 540 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 540 mSDsluCounter, 4211 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3227 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1214 IncrementalHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 984 mSDtfsCounter, 1214 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1086 GetRequests, 959 SyntacticMatches, 11 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=960occurred in iteration=4, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 594 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1680 NumberOfCodeBlocks, 1620 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1864 ConstructedInterpolants, 0 QuantifiedInterpolants, 3141 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1252 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 434/1053 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 01:16:00,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e932f63-2916-4ade-b63d-32a457fb9c7e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE