./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.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_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/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_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/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_4b194b13-4a3b-41a0-9f31-c945d87e3c58/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 4d853145e48ada6aa212af657ef21b1dd6bc82cb156511f71c23f87b45f2510e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:31:33,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:31:33,649 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DataRace-32bit-Taipan_Default.epf [2024-11-09 06:31:33,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:31:33,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:31:33,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:31:33,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:31:33,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:31:33,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:31:33,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:31:33,712 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:31:33,714 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:31:33,715 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:31:33,715 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:31:33,715 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:31:33,716 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:31:33,716 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:31:33,717 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:31:33,717 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:31:33,717 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:31:33,722 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:31:33,723 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:31:33,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:31:33,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:31:33,724 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:31:33,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:31:33,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:31:33,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:31:33,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:31:33,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:31:33,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:31:33,730 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:31:33,730 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:31:33,730 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:31:33,731 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:31:33,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:31:33,732 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:31:33,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:31:33,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:31:33,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:31:33,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:31:33,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:31:33,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:31:33,736 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:31:33,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:31:33,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:31:33,738 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:31:33,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:31:33,738 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_4b194b13-4a3b-41a0-9f31-c945d87e3c58/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_4b194b13-4a3b-41a0-9f31-c945d87e3c58/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 -> 4d853145e48ada6aa212af657ef21b1dd6bc82cb156511f71c23f87b45f2510e [2024-11-09 06:31:34,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:31:34,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:31:34,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:31:34,131 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:31:34,132 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:31:34,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i Unable to find full path for "g++" [2024-11-09 06:31:36,576 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:31:37,072 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:31:37,073 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i [2024-11-09 06:31:37,101 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/data/8ff3b866a/f313cd934081457caa259437eec6c18a/FLAG554f2a103 [2024-11-09 06:31:37,128 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/data/8ff3b866a/f313cd934081457caa259437eec6c18a [2024-11-09 06:31:37,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:31:37,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:31:37,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:31:37,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:31:37,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:31:37,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:31:37" (1/1) ... [2024-11-09 06:31:37,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20786e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:31:37, skipping insertion in model container [2024-11-09 06:31:37,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:31:37" (1/1) ... [2024-11-09 06:31:37,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:31:37,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:31:38,009 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:31:38,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:31:38,152 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:31:38,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:31:38 WrapperNode [2024-11-09 06:31:38,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:31:38,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:31:38,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:31:38,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:31:38,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:31:38" (1/1) ... [2024-11-09 06:31:38,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:31:38" (1/1) ... [2024-11-09 06:31:38,223 INFO L138 Inliner]: procedures = 263, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 176 [2024-11-09 06:31:38,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:31:38,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:31:38,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:31:38,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:31:38,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:31:38" (1/1) ... [2024-11-09 06:31:38,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:31:38" (1/1) ... [2024-11-09 06:31:38,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:31:38" (1/1) ... [2024-11-09 06:31:38,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:31:38" (1/1) ... [2024-11-09 06:31:38,272 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:31:38" (1/1) ... [2024-11-09 06:31:38,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:31:38" (1/1) ... [2024-11-09 06:31:38,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:31:38" (1/1) ... [2024-11-09 06:31:38,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:31:38" (1/1) ... [2024-11-09 06:31:38,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:31:38,286 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:31:38,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:31:38,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:31:38,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:31:38" (1/1) ... [2024-11-09 06:31:38,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:31:38,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:31:38,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:31:38,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:31:38,395 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 06:31:38,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:31:38,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:31:38,396 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 06:31:38,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:31:38,397 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 06:31:38,399 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 06:31:38,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:31:38,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:31:38,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:31:38,403 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 06:31:38,676 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:31:38,680 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:31:39,294 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:31:39,295 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:31:39,345 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:31:39,346 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:31:39,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:31:39 BoogieIcfgContainer [2024-11-09 06:31:39,347 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:31:39,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:31:39,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:31:39,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:31:39,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:31:37" (1/3) ... [2024-11-09 06:31:39,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2d7c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:31:39, skipping insertion in model container [2024-11-09 06:31:39,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:31:38" (2/3) ... [2024-11-09 06:31:39,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2d7c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:31:39, skipping insertion in model container [2024-11-09 06:31:39,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:31:39" (3/3) ... [2024-11-09 06:31:39,359 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_04-funloop_hard1.i [2024-11-09 06:31:39,388 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:31:39,389 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-09 06:31:39,389 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:31:39,522 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 06:31:39,573 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 186 places, 188 transitions, 380 flow [2024-11-09 06:31:39,813 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2546 states, 2532 states have (on average 2.0169826224328595) internal successors, (5107), 2545 states have internal predecessors, (5107), 0 states have call successors, (0), 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 06:31:39,859 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:31:39,868 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;@5cfc9f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:31:39,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-09 06:31:39,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 2546 states, 2532 states have (on average 2.0169826224328595) internal successors, (5107), 2545 states have internal predecessors, (5107), 0 states have call successors, (0), 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 06:31:39,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-09 06:31:39,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:39,904 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] [2024-11-09 06:31:39,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:31:39,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:39,916 INFO L85 PathProgramCache]: Analyzing trace with hash 533362969, now seen corresponding path program 1 times [2024-11-09 06:31:39,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:39,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861588676] [2024-11-09 06:31:39,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:39,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:40,625 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 06:31:40,626 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:40,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861588676] [2024-11-09 06:31:40,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861588676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:40,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:31:40,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:31:40,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243825963] [2024-11-09 06:31:40,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:40,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:31:40,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:40,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:31:40,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:31:40,688 INFO L87 Difference]: Start difference. First operand has 2546 states, 2532 states have (on average 2.0169826224328595) internal successors, (5107), 2545 states have internal predecessors, (5107), 0 states have call successors, (0), 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 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:31:40,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:40,935 INFO L93 Difference]: Finished difference Result 5024 states and 10146 transitions. [2024-11-09 06:31:40,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:31:40,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-09 06:31:40,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:40,974 INFO L225 Difference]: With dead ends: 5024 [2024-11-09 06:31:40,975 INFO L226 Difference]: Without dead ends: 2551 [2024-11-09 06:31:40,987 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 06:31:40,991 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 4 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:40,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 345 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:31:41,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2024-11-09 06:31:41,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 2548. [2024-11-09 06:31:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 2534 states have (on average 2.016179952644041) internal successors, (5109), 2547 states have internal predecessors, (5109), 0 states have call successors, (0), 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 06:31:41,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 5109 transitions. [2024-11-09 06:31:41,205 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 5109 transitions. Word has length 87 [2024-11-09 06:31:41,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:41,206 INFO L471 AbstractCegarLoop]: Abstraction has 2548 states and 5109 transitions. [2024-11-09 06:31:41,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:31:41,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 5109 transitions. [2024-11-09 06:31:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 06:31:41,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:41,212 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] [2024-11-09 06:31:41,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:31:41,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:31:41,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:41,214 INFO L85 PathProgramCache]: Analyzing trace with hash 994570069, now seen corresponding path program 1 times [2024-11-09 06:31:41,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:41,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963000101] [2024-11-09 06:31:41,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:41,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:41,463 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 06:31:41,464 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:41,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963000101] [2024-11-09 06:31:41,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963000101] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:31:41,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712323759] [2024-11-09 06:31:41,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:41,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:41,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:31:41,468 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:31:41,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:31:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:41,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 06:31:41,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:31:41,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:31:41,773 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:31:41,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712323759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:41,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:31:41,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 06:31:41,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722688547] [2024-11-09 06:31:41,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:41,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:31:41,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:41,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:31:41,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:31:41,784 INFO L87 Difference]: Start difference. First operand 2548 states and 5109 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 06:31:41,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:41,936 INFO L93 Difference]: Finished difference Result 4858 states and 9818 transitions. [2024-11-09 06:31:41,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:31:41,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-11-09 06:31:41,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:41,966 INFO L225 Difference]: With dead ends: 4858 [2024-11-09 06:31:41,967 INFO L226 Difference]: Without dead ends: 3796 [2024-11-09 06:31:41,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:31:41,973 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 71 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:41,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 383 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:31:41,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3796 states. [2024-11-09 06:31:42,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3796 to 2626. [2024-11-09 06:31:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2612 states have (on average 2.0164624808575806) internal successors, (5267), 2625 states have internal predecessors, (5267), 0 states have call successors, (0), 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 06:31:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 5267 transitions. [2024-11-09 06:31:42,112 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 5267 transitions. Word has length 93 [2024-11-09 06:31:42,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:42,115 INFO L471 AbstractCegarLoop]: Abstraction has 2626 states and 5267 transitions. [2024-11-09 06:31:42,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 06:31:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 5267 transitions. [2024-11-09 06:31:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 06:31:42,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:42,125 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] [2024-11-09 06:31:42,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:31:42,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:42,327 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:31:42,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:42,329 INFO L85 PathProgramCache]: Analyzing trace with hash -263909244, now seen corresponding path program 1 times [2024-11-09 06:31:42,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:42,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489722357] [2024-11-09 06:31:42,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:42,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:42,600 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 06:31:42,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:42,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489722357] [2024-11-09 06:31:42,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489722357] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:31:42,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568112518] [2024-11-09 06:31:42,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:42,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:42,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:31:42,607 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:31:42,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:31:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:42,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:31:42,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:31:42,895 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 06:31:42,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:31:42,982 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 06:31:42,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568112518] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:31:42,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1209039610] [2024-11-09 06:31:43,002 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 06:31:43,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:31:43,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 06:31:43,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728520195] [2024-11-09 06:31:43,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:31:43,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:31:43,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:43,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:31:43,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:31:43,013 INFO L87 Difference]: Start difference. First operand 2626 states and 5267 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:31:43,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:43,240 INFO L93 Difference]: Finished difference Result 5188 states and 10471 transitions. [2024-11-09 06:31:43,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:31:43,241 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-11-09 06:31:43,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:43,263 INFO L225 Difference]: With dead ends: 5188 [2024-11-09 06:31:43,264 INFO L226 Difference]: Without dead ends: 2637 [2024-11-09 06:31:43,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 189 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 06:31:43,271 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 15 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:43,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 685 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:31:43,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2024-11-09 06:31:43,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 2637. [2024-11-09 06:31:43,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2637 states, 2623 states have (on average 2.0118185284025922) internal successors, (5277), 2636 states have internal predecessors, (5277), 0 states have call successors, (0), 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 06:31:43,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 5277 transitions. [2024-11-09 06:31:43,386 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 5277 transitions. Word has length 97 [2024-11-09 06:31:43,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:43,387 INFO L471 AbstractCegarLoop]: Abstraction has 2637 states and 5277 transitions. [2024-11-09 06:31:43,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:31:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 5277 transitions. [2024-11-09 06:31:43,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 06:31:43,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:43,392 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] [2024-11-09 06:31:43,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 06:31:43,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:43,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:31:43,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:43,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1725797892, now seen corresponding path program 2 times [2024-11-09 06:31:43,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:43,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102291650] [2024-11-09 06:31:43,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:43,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:44,055 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 06:31:44,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:44,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102291650] [2024-11-09 06:31:44,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102291650] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:31:44,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062542670] [2024-11-09 06:31:44,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:31:44,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:44,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:31:44,067 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:31:44,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:31:44,239 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 06:31:44,239 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:31:44,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 06:31:44,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:31:44,324 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 06:31:44,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 06:31:44,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:31:44,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-09 06:31:44,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:31:44,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-09 06:31:44,555 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 06:31:44,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:31:44,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062542670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:44,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:31:44,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-11-09 06:31:44,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853547436] [2024-11-09 06:31:44,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:44,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:31:44,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:44,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:31:44,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:31:44,561 INFO L87 Difference]: Start difference. First operand 2637 states and 5277 transitions. Second operand has 6 states, 5 states have (on average 19.4) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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 06:31:45,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:45,196 INFO L93 Difference]: Finished difference Result 3186 states and 6384 transitions. [2024-11-09 06:31:45,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:31:45,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.4) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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 109 [2024-11-09 06:31:45,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:45,222 INFO L225 Difference]: With dead ends: 3186 [2024-11-09 06:31:45,222 INFO L226 Difference]: Without dead ends: 3120 [2024-11-09 06:31:45,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:31:45,226 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 208 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:45,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 607 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:31:45,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2024-11-09 06:31:45,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2876. [2024-11-09 06:31:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2862 states have (on average 2.0122292103424178) internal successors, (5759), 2875 states have internal predecessors, (5759), 0 states have call successors, (0), 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 06:31:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 5759 transitions. [2024-11-09 06:31:45,343 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 5759 transitions. Word has length 109 [2024-11-09 06:31:45,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:45,344 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 5759 transitions. [2024-11-09 06:31:45,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.4) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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 06:31:45,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 5759 transitions. [2024-11-09 06:31:45,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 06:31:45,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:45,347 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] [2024-11-09 06:31:45,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 06:31:45,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:45,548 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:31:45,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:45,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1731774378, now seen corresponding path program 1 times [2024-11-09 06:31:45,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:45,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231657956] [2024-11-09 06:31:45,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:45,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:45,889 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 06:31:45,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:45,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231657956] [2024-11-09 06:31:45,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231657956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:31:45,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539853525] [2024-11-09 06:31:45,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:45,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:45,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:31:45,895 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:31:45,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:31:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:46,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:31:46,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:31:46,149 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 06:31:46,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:31:46,334 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 06:31:46,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539853525] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:31:46,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [148692718] [2024-11-09 06:31:46,340 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 06:31:46,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:31:46,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-09 06:31:46,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359921961] [2024-11-09 06:31:46,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:31:46,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 06:31:46,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:46,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 06:31:46,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-09 06:31:46,349 INFO L87 Difference]: Start difference. First operand 2876 states and 5759 transitions. Second operand has 18 states, 18 states have (on average 7.5) internal successors, (135), 18 states have internal predecessors, (135), 0 states have call successors, (0), 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 06:31:46,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:46,795 INFO L93 Difference]: Finished difference Result 5690 states and 11459 transitions. [2024-11-09 06:31:46,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 06:31:46,796 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.5) internal successors, (135), 18 states have internal predecessors, (135), 0 states have call successors, (0), 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 109 [2024-11-09 06:31:46,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:46,820 INFO L225 Difference]: With dead ends: 5690 [2024-11-09 06:31:46,820 INFO L226 Difference]: Without dead ends: 2900 [2024-11-09 06:31:46,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2024-11-09 06:31:46,829 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 29 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:46,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1364 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:31:46,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2024-11-09 06:31:46,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 2900. [2024-11-09 06:31:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2900 states, 2886 states have (on average 2.003811503811504) internal successors, (5783), 2899 states have internal predecessors, (5783), 0 states have call successors, (0), 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 06:31:46,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 5783 transitions. [2024-11-09 06:31:46,942 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 5783 transitions. Word has length 109 [2024-11-09 06:31:46,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:46,943 INFO L471 AbstractCegarLoop]: Abstraction has 2900 states and 5783 transitions. [2024-11-09 06:31:46,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.5) internal successors, (135), 18 states have internal predecessors, (135), 0 states have call successors, (0), 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 06:31:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 5783 transitions. [2024-11-09 06:31:46,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 06:31:46,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:46,947 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] [2024-11-09 06:31:46,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 06:31:47,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:47,151 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:31:47,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:47,152 INFO L85 PathProgramCache]: Analyzing trace with hash -360046950, now seen corresponding path program 2 times [2024-11-09 06:31:47,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:47,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879050648] [2024-11-09 06:31:47,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:47,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:47,809 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 06:31:47,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:47,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879050648] [2024-11-09 06:31:47,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879050648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:31:47,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083241968] [2024-11-09 06:31:47,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:31:47,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:47,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:31:47,815 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:31:47,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 06:31:47,957 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 06:31:47,958 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:31:47,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 06:31:47,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:31:47,986 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 06:31:48,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 06:31:48,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:31:48,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-09 06:31:48,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:31:48,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-09 06:31:48,215 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 06:31:48,215 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:31:48,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083241968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:48,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:31:48,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2024-11-09 06:31:48,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756540006] [2024-11-09 06:31:48,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:48,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:31:48,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:48,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:31:48,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-09 06:31:48,219 INFO L87 Difference]: Start difference. First operand 2900 states and 5783 transitions. Second operand has 6 states, 5 states have (on average 19.4) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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 06:31:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:48,716 INFO L93 Difference]: Finished difference Result 3215 states and 6422 transitions. [2024-11-09 06:31:48,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:31:48,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.4) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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 133 [2024-11-09 06:31:48,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:48,743 INFO L225 Difference]: With dead ends: 3215 [2024-11-09 06:31:48,743 INFO L226 Difference]: Without dead ends: 3172 [2024-11-09 06:31:48,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-09 06:31:48,747 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 136 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:48,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 795 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:31:48,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3172 states. [2024-11-09 06:31:48,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3172 to 3032. [2024-11-09 06:31:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3032 states, 3019 states have (on average 2.0043060616098045) internal successors, (6051), 3031 states have internal predecessors, (6051), 0 states have call successors, (0), 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 06:31:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3032 states to 3032 states and 6051 transitions. [2024-11-09 06:31:48,882 INFO L78 Accepts]: Start accepts. Automaton has 3032 states and 6051 transitions. Word has length 133 [2024-11-09 06:31:48,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:48,883 INFO L471 AbstractCegarLoop]: Abstraction has 3032 states and 6051 transitions. [2024-11-09 06:31:48,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.4) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 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 06:31:48,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3032 states and 6051 transitions. [2024-11-09 06:31:48,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 06:31:48,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:48,886 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] [2024-11-09 06:31:48,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 06:31:49,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 06:31:49,091 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:31:49,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:49,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1662211215, now seen corresponding path program 1 times [2024-11-09 06:31:49,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:49,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760877293] [2024-11-09 06:31:49,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:49,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:49,698 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 06:31:49,698 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:49,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760877293] [2024-11-09 06:31:49,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760877293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:31:49,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641281778] [2024-11-09 06:31:49,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:49,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:49,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:31:49,706 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:31:49,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:31:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:49,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 06:31:49,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:31:50,080 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 06:31:50,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:31:50,443 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 06:31:50,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641281778] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:31:50,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2090980201] [2024-11-09 06:31:50,448 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 06:31:50,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:31:50,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2024-11-09 06:31:50,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670101557] [2024-11-09 06:31:50,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:31:50,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 06:31:50,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:50,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 06:31:50,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-11-09 06:31:50,455 INFO L87 Difference]: Start difference. First operand 3032 states and 6051 transitions. Second operand has 23 states, 23 states have (on average 7.0) internal successors, (161), 23 states have internal predecessors, (161), 0 states have call successors, (0), 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 06:31:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:51,057 INFO L93 Difference]: Finished difference Result 5972 states and 12012 transitions. [2024-11-09 06:31:51,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-09 06:31:51,058 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.0) internal successors, (161), 23 states have internal predecessors, (161), 0 states have call successors, (0), 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 141 [2024-11-09 06:31:51,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:51,083 INFO L225 Difference]: With dead ends: 5972 [2024-11-09 06:31:51,083 INFO L226 Difference]: Without dead ends: 3050 [2024-11-09 06:31:51,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 265 SyntacticMatches, 11 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 06:31:51,092 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 44 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:51,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1198 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:31:51,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3050 states. [2024-11-09 06:31:51,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3050 to 3050. [2024-11-09 06:31:51,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3050 states, 3037 states have (on average 1.9983536384590055) internal successors, (6069), 3049 states have internal predecessors, (6069), 0 states have call successors, (0), 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 06:31:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 6069 transitions. [2024-11-09 06:31:51,201 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 6069 transitions. Word has length 141 [2024-11-09 06:31:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:51,202 INFO L471 AbstractCegarLoop]: Abstraction has 3050 states and 6069 transitions. [2024-11-09 06:31:51,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.0) internal successors, (161), 23 states have internal predecessors, (161), 0 states have call successors, (0), 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 06:31:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 6069 transitions. [2024-11-09 06:31:51,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 06:31:51,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:51,206 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] [2024-11-09 06:31:51,232 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 06:31:51,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:51,411 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:31:51,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:51,411 INFO L85 PathProgramCache]: Analyzing trace with hash 98871333, now seen corresponding path program 2 times [2024-11-09 06:31:51,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:51,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315229276] [2024-11-09 06:31:51,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:51,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:52,423 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 06:31:52,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:52,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315229276] [2024-11-09 06:31:52,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315229276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:52,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:31:52,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:31:52,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099205743] [2024-11-09 06:31:52,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:52,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:31:52,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:52,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:31:52,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:31:52,426 INFO L87 Difference]: Start difference. First operand 3050 states and 6069 transitions. Second operand has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 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 06:31:53,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:53,023 INFO L93 Difference]: Finished difference Result 3550 states and 7073 transitions. [2024-11-09 06:31:53,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:31:53,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 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 159 [2024-11-09 06:31:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:53,059 INFO L225 Difference]: With dead ends: 3550 [2024-11-09 06:31:53,059 INFO L226 Difference]: Without dead ends: 3110 [2024-11-09 06:31:53,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:31:53,063 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 205 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:53,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 705 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:31:53,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2024-11-09 06:31:53,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 2948. [2024-11-09 06:31:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2948 states, 2935 states have (on average 1.9928449744463372) internal successors, (5849), 2947 states have internal predecessors, (5849), 0 states have call successors, (0), 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 06:31:53,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 5849 transitions. [2024-11-09 06:31:53,171 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 5849 transitions. Word has length 159 [2024-11-09 06:31:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:53,172 INFO L471 AbstractCegarLoop]: Abstraction has 2948 states and 5849 transitions. [2024-11-09 06:31:53,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 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 06:31:53,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 5849 transitions. [2024-11-09 06:31:53,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 06:31:53,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:53,176 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] [2024-11-09 06:31:53,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:31:53,176 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:31:53,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:53,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1171863775, now seen corresponding path program 1 times [2024-11-09 06:31:53,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:53,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596514102] [2024-11-09 06:31:53,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:53,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:54,083 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 06:31:54,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:54,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596514102] [2024-11-09 06:31:54,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596514102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:54,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:31:54,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:31:54,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423187904] [2024-11-09 06:31:54,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:54,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:31:54,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:54,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:31:54,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:31:54,087 INFO L87 Difference]: Start difference. First operand 2948 states and 5849 transitions. Second operand has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 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 06:31:54,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:54,485 INFO L93 Difference]: Finished difference Result 3260 states and 6473 transitions. [2024-11-09 06:31:54,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:31:54,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 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 159 [2024-11-09 06:31:54,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:54,519 INFO L225 Difference]: With dead ends: 3260 [2024-11-09 06:31:54,520 INFO L226 Difference]: Without dead ends: 3213 [2024-11-09 06:31:54,522 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 06:31:54,524 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 134 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:54,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 570 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:31:54,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3213 states. [2024-11-09 06:31:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3213 to 3087. [2024-11-09 06:31:54,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3087 states, 3074 states have (on average 1.994469746258946) internal successors, (6131), 3086 states have internal predecessors, (6131), 0 states have call successors, (0), 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 06:31:54,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 3087 states and 6131 transitions. [2024-11-09 06:31:54,680 INFO L78 Accepts]: Start accepts. Automaton has 3087 states and 6131 transitions. Word has length 159 [2024-11-09 06:31:54,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:54,681 INFO L471 AbstractCegarLoop]: Abstraction has 3087 states and 6131 transitions. [2024-11-09 06:31:54,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 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 06:31:54,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3087 states and 6131 transitions. [2024-11-09 06:31:54,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:31:54,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:54,687 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, 1, 1] [2024-11-09 06:31:54,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:31:54,688 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:31:54,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:54,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2109276301, now seen corresponding path program 1 times [2024-11-09 06:31:54,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:54,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512574476] [2024-11-09 06:31:54,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:54,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:55,751 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 06:31:55,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:55,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512574476] [2024-11-09 06:31:55,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512574476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:55,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:31:55,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:31:55,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657592312] [2024-11-09 06:31:55,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:55,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:31:55,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:55,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:31:55,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:31:55,758 INFO L87 Difference]: Start difference. First operand 3087 states and 6131 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:31:57,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:57,342 INFO L93 Difference]: Finished difference Result 9630 states and 19412 transitions. [2024-11-09 06:31:57,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:31:57,343 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:31:57,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:57,384 INFO L225 Difference]: With dead ends: 9630 [2024-11-09 06:31:57,384 INFO L226 Difference]: Without dead ends: 6995 [2024-11-09 06:31:57,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:31:57,395 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 470 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:57,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1611 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 06:31:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6995 states. [2024-11-09 06:31:57,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6995 to 3378. [2024-11-09 06:31:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3378 states, 3365 states have (on average 1.9898959881129272) internal successors, (6696), 3377 states have internal predecessors, (6696), 0 states have call successors, (0), 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 06:31:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3378 states to 3378 states and 6696 transitions. [2024-11-09 06:31:57,651 INFO L78 Accepts]: Start accepts. Automaton has 3378 states and 6696 transitions. Word has length 171 [2024-11-09 06:31:57,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:57,651 INFO L471 AbstractCegarLoop]: Abstraction has 3378 states and 6696 transitions. [2024-11-09 06:31:57,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:31:57,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3378 states and 6696 transitions. [2024-11-09 06:31:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:31:57,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:57,656 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, 1, 1] [2024-11-09 06:31:57,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:31:57,657 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:31:57,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:57,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1147320485, now seen corresponding path program 1 times [2024-11-09 06:31:57,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:57,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587655858] [2024-11-09 06:31:57,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:57,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:58,610 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 06:31:58,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:58,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587655858] [2024-11-09 06:31:58,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587655858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:58,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:31:58,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:31:58,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723952367] [2024-11-09 06:31:58,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:58,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:31:58,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:58,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:31:58,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:31:58,614 INFO L87 Difference]: Start difference. First operand 3378 states and 6696 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:00,156 INFO L93 Difference]: Finished difference Result 9371 states and 18783 transitions. [2024-11-09 06:32:00,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:00,157 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:00,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:00,191 INFO L225 Difference]: With dead ends: 9371 [2024-11-09 06:32:00,191 INFO L226 Difference]: Without dead ends: 6751 [2024-11-09 06:32:00,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:32:00,202 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 423 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:00,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1513 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 06:32:00,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6751 states. [2024-11-09 06:32:00,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6751 to 3381. [2024-11-09 06:32:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3368 states have (on average 1.9899049881235154) internal successors, (6702), 3380 states have internal predecessors, (6702), 0 states have call successors, (0), 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 06:32:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 6702 transitions. [2024-11-09 06:32:00,418 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 6702 transitions. Word has length 171 [2024-11-09 06:32:00,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:00,419 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 6702 transitions. [2024-11-09 06:32:00,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:00,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 6702 transitions. [2024-11-09 06:32:00,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:00,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:00,426 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, 1, 1] [2024-11-09 06:32:00,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:32:00,426 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:00,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:00,427 INFO L85 PathProgramCache]: Analyzing trace with hash -135173923, now seen corresponding path program 2 times [2024-11-09 06:32:00,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:00,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554946201] [2024-11-09 06:32:00,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:00,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:01,412 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 06:32:01,413 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:01,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554946201] [2024-11-09 06:32:01,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554946201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:01,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:01,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:01,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543234987] [2024-11-09 06:32:01,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:01,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:01,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:01,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:01,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:01,416 INFO L87 Difference]: Start difference. First operand 3381 states and 6702 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:02,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:02,888 INFO L93 Difference]: Finished difference Result 9238 states and 18517 transitions. [2024-11-09 06:32:02,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:02,889 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:02,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:02,928 INFO L225 Difference]: With dead ends: 9238 [2024-11-09 06:32:02,928 INFO L226 Difference]: Without dead ends: 6618 [2024-11-09 06:32:02,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:32:02,938 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 447 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:02,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1735 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 06:32:02,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6618 states. [2024-11-09 06:32:03,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6618 to 3383. [2024-11-09 06:32:03,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3383 states, 3370 states have (on average 1.9899109792284866) internal successors, (6706), 3382 states have internal predecessors, (6706), 0 states have call successors, (0), 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 06:32:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3383 states to 3383 states and 6706 transitions. [2024-11-09 06:32:03,100 INFO L78 Accepts]: Start accepts. Automaton has 3383 states and 6706 transitions. Word has length 171 [2024-11-09 06:32:03,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:03,101 INFO L471 AbstractCegarLoop]: Abstraction has 3383 states and 6706 transitions. [2024-11-09 06:32:03,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3383 states and 6706 transitions. [2024-11-09 06:32:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:03,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:03,106 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, 1, 1] [2024-11-09 06:32:03,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:32:03,106 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:03,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:03,107 INFO L85 PathProgramCache]: Analyzing trace with hash 907000285, now seen corresponding path program 3 times [2024-11-09 06:32:03,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:03,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014574387] [2024-11-09 06:32:03,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:03,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:03,882 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 06:32:03,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:03,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014574387] [2024-11-09 06:32:03,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014574387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:03,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:03,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:03,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515120924] [2024-11-09 06:32:03,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:03,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:03,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:03,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:03,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:03,885 INFO L87 Difference]: Start difference. First operand 3383 states and 6706 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:05,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:05,037 INFO L93 Difference]: Finished difference Result 8429 states and 16899 transitions. [2024-11-09 06:32:05,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:05,038 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:05,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:05,072 INFO L225 Difference]: With dead ends: 8429 [2024-11-09 06:32:05,073 INFO L226 Difference]: Without dead ends: 5809 [2024-11-09 06:32:05,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:32:05,083 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 470 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:05,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1308 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:32:05,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5809 states. [2024-11-09 06:32:05,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5809 to 3403. [2024-11-09 06:32:05,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3403 states, 3390 states have (on average 1.9843657817109144) internal successors, (6727), 3402 states have internal predecessors, (6727), 0 states have call successors, (0), 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 06:32:05,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 6727 transitions. [2024-11-09 06:32:05,248 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 6727 transitions. Word has length 171 [2024-11-09 06:32:05,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:05,248 INFO L471 AbstractCegarLoop]: Abstraction has 3403 states and 6727 transitions. [2024-11-09 06:32:05,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:05,249 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 6727 transitions. [2024-11-09 06:32:05,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:05,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:05,254 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, 1, 1] [2024-11-09 06:32:05,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:32:05,254 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:05,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:05,255 INFO L85 PathProgramCache]: Analyzing trace with hash -504638131, now seen corresponding path program 4 times [2024-11-09 06:32:05,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:05,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616314402] [2024-11-09 06:32:05,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:05,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:06,065 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 06:32:06,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:06,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616314402] [2024-11-09 06:32:06,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616314402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:06,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:06,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:06,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037632062] [2024-11-09 06:32:06,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:06,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:06,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:06,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:06,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:06,068 INFO L87 Difference]: Start difference. First operand 3403 states and 6727 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:07,460 INFO L93 Difference]: Finished difference Result 9656 states and 19334 transitions. [2024-11-09 06:32:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:07,460 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:07,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:07,501 INFO L225 Difference]: With dead ends: 9656 [2024-11-09 06:32:07,501 INFO L226 Difference]: Without dead ends: 7036 [2024-11-09 06:32:07,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:32:07,512 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 404 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:07,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1481 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 06:32:07,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7036 states. [2024-11-09 06:32:07,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7036 to 3412. [2024-11-09 06:32:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3412 states, 3399 states have (on average 1.984407178581936) internal successors, (6745), 3411 states have internal predecessors, (6745), 0 states have call successors, (0), 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 06:32:07,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3412 states to 3412 states and 6745 transitions. [2024-11-09 06:32:07,738 INFO L78 Accepts]: Start accepts. Automaton has 3412 states and 6745 transitions. Word has length 171 [2024-11-09 06:32:07,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:07,739 INFO L471 AbstractCegarLoop]: Abstraction has 3412 states and 6745 transitions. [2024-11-09 06:32:07,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:07,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3412 states and 6745 transitions. [2024-11-09 06:32:07,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:07,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:07,747 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, 1, 1] [2024-11-09 06:32:07,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:32:07,749 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:07,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:07,750 INFO L85 PathProgramCache]: Analyzing trace with hash 507508431, now seen corresponding path program 5 times [2024-11-09 06:32:07,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:07,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700655115] [2024-11-09 06:32:07,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:07,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:08,607 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 06:32:08,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:08,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700655115] [2024-11-09 06:32:08,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700655115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:08,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:08,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:08,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105368674] [2024-11-09 06:32:08,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:08,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:08,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:08,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:08,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:08,610 INFO L87 Difference]: Start difference. First operand 3412 states and 6745 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:10,055 INFO L93 Difference]: Finished difference Result 10501 states and 21005 transitions. [2024-11-09 06:32:10,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:10,055 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:10,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:10,097 INFO L225 Difference]: With dead ends: 10501 [2024-11-09 06:32:10,098 INFO L226 Difference]: Without dead ends: 7881 [2024-11-09 06:32:10,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:32:10,108 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 478 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:10,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1634 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 06:32:10,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7881 states. [2024-11-09 06:32:10,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7881 to 3414. [2024-11-09 06:32:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3414 states, 3401 states have (on average 1.984416348132902) internal successors, (6749), 3413 states have internal predecessors, (6749), 0 states have call successors, (0), 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 06:32:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3414 states to 3414 states and 6749 transitions. [2024-11-09 06:32:10,257 INFO L78 Accepts]: Start accepts. Automaton has 3414 states and 6749 transitions. Word has length 171 [2024-11-09 06:32:10,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:10,258 INFO L471 AbstractCegarLoop]: Abstraction has 3414 states and 6749 transitions. [2024-11-09 06:32:10,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:10,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3414 states and 6749 transitions. [2024-11-09 06:32:10,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:10,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:10,263 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, 1, 1] [2024-11-09 06:32:10,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:32:10,264 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:10,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:10,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1549682639, now seen corresponding path program 6 times [2024-11-09 06:32:10,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:10,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960228138] [2024-11-09 06:32:10,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:10,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:10,903 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 06:32:10,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:10,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960228138] [2024-11-09 06:32:10,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960228138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:10,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:10,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:10,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549909737] [2024-11-09 06:32:10,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:10,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:10,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:10,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:10,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:10,907 INFO L87 Difference]: Start difference. First operand 3414 states and 6749 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:12,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:12,125 INFO L93 Difference]: Finished difference Result 9712 states and 19427 transitions. [2024-11-09 06:32:12,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:12,126 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:12,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:12,166 INFO L225 Difference]: With dead ends: 9712 [2024-11-09 06:32:12,166 INFO L226 Difference]: Without dead ends: 7092 [2024-11-09 06:32:12,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:32:12,176 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 476 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:12,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1324 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 06:32:12,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7092 states. [2024-11-09 06:32:12,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7092 to 3409. [2024-11-09 06:32:12,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3409 states, 3396 states have (on average 1.9843934040047113) internal successors, (6739), 3408 states have internal predecessors, (6739), 0 states have call successors, (0), 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 06:32:12,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 6739 transitions. [2024-11-09 06:32:12,337 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 6739 transitions. Word has length 171 [2024-11-09 06:32:12,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:12,338 INFO L471 AbstractCegarLoop]: Abstraction has 3409 states and 6739 transitions. [2024-11-09 06:32:12,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:12,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 6739 transitions. [2024-11-09 06:32:12,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:12,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:12,344 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, 1, 1] [2024-11-09 06:32:12,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:32:12,345 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:12,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:12,345 INFO L85 PathProgramCache]: Analyzing trace with hash 85143245, now seen corresponding path program 7 times [2024-11-09 06:32:12,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:12,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094386678] [2024-11-09 06:32:12,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:12,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:13,049 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 06:32:13,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:13,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094386678] [2024-11-09 06:32:13,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094386678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:13,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:13,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:13,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72049714] [2024-11-09 06:32:13,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:13,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:13,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:13,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:13,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:13,052 INFO L87 Difference]: Start difference. First operand 3409 states and 6739 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:14,253 INFO L93 Difference]: Finished difference Result 9470 states and 18962 transitions. [2024-11-09 06:32:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:14,254 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:14,291 INFO L225 Difference]: With dead ends: 9470 [2024-11-09 06:32:14,291 INFO L226 Difference]: Without dead ends: 6850 [2024-11-09 06:32:14,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:32:14,302 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 415 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:14,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1829 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 06:32:14,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6850 states. [2024-11-09 06:32:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6850 to 3415. [2024-11-09 06:32:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3415 states, 3402 states have (on average 1.9844209288653734) internal successors, (6751), 3414 states have internal predecessors, (6751), 0 states have call successors, (0), 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 06:32:14,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 6751 transitions. [2024-11-09 06:32:14,465 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 6751 transitions. Word has length 171 [2024-11-09 06:32:14,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:14,466 INFO L471 AbstractCegarLoop]: Abstraction has 3415 states and 6751 transitions. [2024-11-09 06:32:14,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:14,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 6751 transitions. [2024-11-09 06:32:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:14,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:14,471 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, 1, 1] [2024-11-09 06:32:14,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:32:14,472 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:14,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:14,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1127317453, now seen corresponding path program 8 times [2024-11-09 06:32:14,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:14,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637428477] [2024-11-09 06:32:14,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:14,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:15,172 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 06:32:15,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:15,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637428477] [2024-11-09 06:32:15,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637428477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:15,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:15,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:15,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741766360] [2024-11-09 06:32:15,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:15,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:15,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:15,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:15,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:15,178 INFO L87 Difference]: Start difference. First operand 3415 states and 6751 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:16,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:16,218 INFO L93 Difference]: Finished difference Result 9536 states and 19075 transitions. [2024-11-09 06:32:16,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:16,219 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:16,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:16,269 INFO L225 Difference]: With dead ends: 9536 [2024-11-09 06:32:16,270 INFO L226 Difference]: Without dead ends: 6916 [2024-11-09 06:32:16,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:32:16,282 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 477 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:16,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1448 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:32:16,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6916 states. [2024-11-09 06:32:16,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6916 to 3413. [2024-11-09 06:32:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3413 states, 3400 states have (on average 1.9844117647058823) internal successors, (6747), 3412 states have internal predecessors, (6747), 0 states have call successors, (0), 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 06:32:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3413 states to 3413 states and 6747 transitions. [2024-11-09 06:32:16,450 INFO L78 Accepts]: Start accepts. Automaton has 3413 states and 6747 transitions. Word has length 171 [2024-11-09 06:32:16,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:16,451 INFO L471 AbstractCegarLoop]: Abstraction has 3413 states and 6747 transitions. [2024-11-09 06:32:16,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:16,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3413 states and 6747 transitions. [2024-11-09 06:32:16,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:16,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:16,455 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, 1, 1] [2024-11-09 06:32:16,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 06:32:16,456 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:16,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:16,457 INFO L85 PathProgramCache]: Analyzing trace with hash -292219645, now seen corresponding path program 9 times [2024-11-09 06:32:16,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:16,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172115853] [2024-11-09 06:32:16,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:16,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:17,058 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 06:32:17,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:17,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172115853] [2024-11-09 06:32:17,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172115853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:17,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:17,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:17,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078034105] [2024-11-09 06:32:17,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:17,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:17,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:17,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:17,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:17,061 INFO L87 Difference]: Start difference. First operand 3413 states and 6747 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:18,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:18,158 INFO L93 Difference]: Finished difference Result 9423 states and 18868 transitions. [2024-11-09 06:32:18,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:18,158 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:18,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:18,193 INFO L225 Difference]: With dead ends: 9423 [2024-11-09 06:32:18,193 INFO L226 Difference]: Without dead ends: 6803 [2024-11-09 06:32:18,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:32:18,203 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 482 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:18,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1657 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:32:18,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6803 states. [2024-11-09 06:32:18,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6803 to 3415. [2024-11-09 06:32:18,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3415 states, 3402 states have (on average 1.9844209288653734) internal successors, (6751), 3414 states have internal predecessors, (6751), 0 states have call successors, (0), 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 06:32:18,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 6751 transitions. [2024-11-09 06:32:18,369 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 6751 transitions. Word has length 171 [2024-11-09 06:32:18,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:18,370 INFO L471 AbstractCegarLoop]: Abstraction has 3415 states and 6751 transitions. [2024-11-09 06:32:18,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:18,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 6751 transitions. [2024-11-09 06:32:18,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:18,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:18,374 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, 1, 1] [2024-11-09 06:32:18,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 06:32:18,374 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:18,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:18,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2040073867, now seen corresponding path program 10 times [2024-11-09 06:32:18,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:18,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628626600] [2024-11-09 06:32:18,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:18,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:18,979 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 06:32:18,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:18,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628626600] [2024-11-09 06:32:18,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628626600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:18,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:18,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:18,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222599109] [2024-11-09 06:32:18,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:18,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:18,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:18,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:18,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:18,983 INFO L87 Difference]: Start difference. First operand 3415 states and 6751 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:19,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:19,955 INFO L93 Difference]: Finished difference Result 8519 states and 17060 transitions. [2024-11-09 06:32:19,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:19,956 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:19,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:19,984 INFO L225 Difference]: With dead ends: 8519 [2024-11-09 06:32:19,984 INFO L226 Difference]: Without dead ends: 5899 [2024-11-09 06:32:19,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:32:19,993 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 364 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:19,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1523 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:32:20,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5899 states. [2024-11-09 06:32:20,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5899 to 3453. [2024-11-09 06:32:20,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3453 states, 3440 states have (on average 1.984593023255814) internal successors, (6827), 3452 states have internal predecessors, (6827), 0 states have call successors, (0), 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 06:32:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3453 states to 3453 states and 6827 transitions. [2024-11-09 06:32:20,152 INFO L78 Accepts]: Start accepts. Automaton has 3453 states and 6827 transitions. Word has length 171 [2024-11-09 06:32:20,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:20,153 INFO L471 AbstractCegarLoop]: Abstraction has 3453 states and 6827 transitions. [2024-11-09 06:32:20,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3453 states and 6827 transitions. [2024-11-09 06:32:20,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:20,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:20,156 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, 1, 1] [2024-11-09 06:32:20,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 06:32:20,157 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:20,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:20,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2060423151, now seen corresponding path program 11 times [2024-11-09 06:32:20,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:20,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768806441] [2024-11-09 06:32:20,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:20,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:20,799 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 06:32:20,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:20,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768806441] [2024-11-09 06:32:20,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768806441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:20,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:20,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:20,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161413394] [2024-11-09 06:32:20,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:20,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:20,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:20,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:20,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:20,802 INFO L87 Difference]: Start difference. First operand 3453 states and 6827 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:21,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:21,975 INFO L93 Difference]: Finished difference Result 9916 states and 19854 transitions. [2024-11-09 06:32:21,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:21,976 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:21,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:22,069 INFO L225 Difference]: With dead ends: 9916 [2024-11-09 06:32:22,070 INFO L226 Difference]: Without dead ends: 7296 [2024-11-09 06:32:22,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:32:22,079 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 396 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:22,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1515 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 06:32:22,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7296 states. [2024-11-09 06:32:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7296 to 3471. [2024-11-09 06:32:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3471 states, 3458 states have (on average 1.9846732215153269) internal successors, (6863), 3470 states have internal predecessors, (6863), 0 states have call successors, (0), 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 06:32:22,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 6863 transitions. [2024-11-09 06:32:22,257 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 6863 transitions. Word has length 171 [2024-11-09 06:32:22,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:22,258 INFO L471 AbstractCegarLoop]: Abstraction has 3471 states and 6863 transitions. [2024-11-09 06:32:22,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:22,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 6863 transitions. [2024-11-09 06:32:22,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:22,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:22,264 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, 1, 1] [2024-11-09 06:32:22,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 06:32:22,265 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:22,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:22,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1222397583, now seen corresponding path program 12 times [2024-11-09 06:32:22,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:22,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423395033] [2024-11-09 06:32:22,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:22,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:22,898 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 06:32:22,898 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:22,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423395033] [2024-11-09 06:32:22,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423395033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:22,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:22,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:22,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353253453] [2024-11-09 06:32:22,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:22,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:22,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:22,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:22,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:22,901 INFO L87 Difference]: Start difference. First operand 3471 states and 6863 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:24,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:24,042 INFO L93 Difference]: Finished difference Result 10761 states and 21525 transitions. [2024-11-09 06:32:24,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:24,043 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:24,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:24,082 INFO L225 Difference]: With dead ends: 10761 [2024-11-09 06:32:24,082 INFO L226 Difference]: Without dead ends: 8141 [2024-11-09 06:32:24,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:32:24,140 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 414 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:24,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1504 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:32:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8141 states. [2024-11-09 06:32:24,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8141 to 3473. [2024-11-09 06:32:24,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3473 states, 3460 states have (on average 1.9846820809248555) internal successors, (6867), 3472 states have internal predecessors, (6867), 0 states have call successors, (0), 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 06:32:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 6867 transitions. [2024-11-09 06:32:24,395 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 6867 transitions. Word has length 171 [2024-11-09 06:32:24,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:24,396 INFO L471 AbstractCegarLoop]: Abstraction has 3473 states and 6867 transitions. [2024-11-09 06:32:24,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:24,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 6867 transitions. [2024-11-09 06:32:24,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:24,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:24,408 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, 1, 1] [2024-11-09 06:32:24,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 06:32:24,408 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:24,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:24,409 INFO L85 PathProgramCache]: Analyzing trace with hash -180223375, now seen corresponding path program 13 times [2024-11-09 06:32:24,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:24,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189296390] [2024-11-09 06:32:24,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:24,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:25,038 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 06:32:25,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:25,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189296390] [2024-11-09 06:32:25,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189296390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:25,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:25,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:25,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102017990] [2024-11-09 06:32:25,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:25,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:25,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:25,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:25,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:25,041 INFO L87 Difference]: Start difference. First operand 3473 states and 6867 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:26,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:26,089 INFO L93 Difference]: Finished difference Result 9972 states and 19947 transitions. [2024-11-09 06:32:26,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:26,090 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:26,129 INFO L225 Difference]: With dead ends: 9972 [2024-11-09 06:32:26,130 INFO L226 Difference]: Without dead ends: 7352 [2024-11-09 06:32:26,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:32:26,137 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 412 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:26,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1441 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:32:26,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7352 states. [2024-11-09 06:32:26,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7352 to 3468. [2024-11-09 06:32:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3468 states, 3455 states have (on average 1.98465991316932) internal successors, (6857), 3467 states have internal predecessors, (6857), 0 states have call successors, (0), 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 06:32:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3468 states to 3468 states and 6857 transitions. [2024-11-09 06:32:26,326 INFO L78 Accepts]: Start accepts. Automaton has 3468 states and 6857 transitions. Word has length 171 [2024-11-09 06:32:26,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:26,327 INFO L471 AbstractCegarLoop]: Abstraction has 3468 states and 6857 transitions. [2024-11-09 06:32:26,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:26,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3468 states and 6857 transitions. [2024-11-09 06:32:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:26,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:26,332 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, 1, 1] [2024-11-09 06:32:26,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 06:32:26,333 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:26,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:26,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1644762769, now seen corresponding path program 14 times [2024-11-09 06:32:26,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:26,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899191711] [2024-11-09 06:32:26,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:26,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:26,950 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 06:32:26,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:26,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899191711] [2024-11-09 06:32:26,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899191711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:26,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:26,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:26,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325663949] [2024-11-09 06:32:26,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:26,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:26,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:26,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:26,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:26,953 INFO L87 Difference]: Start difference. First operand 3468 states and 6857 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:28,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:28,100 INFO L93 Difference]: Finished difference Result 10978 states and 21940 transitions. [2024-11-09 06:32:28,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:28,101 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:28,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:28,146 INFO L225 Difference]: With dead ends: 10978 [2024-11-09 06:32:28,147 INFO L226 Difference]: Without dead ends: 8358 [2024-11-09 06:32:28,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:32:28,157 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 424 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:28,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1663 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:32:28,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8358 states. [2024-11-09 06:32:28,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8358 to 3474. [2024-11-09 06:32:28,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3474 states, 3461 states have (on average 1.984686506789945) internal successors, (6869), 3473 states have internal predecessors, (6869), 0 states have call successors, (0), 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 06:32:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 6869 transitions. [2024-11-09 06:32:28,327 INFO L78 Accepts]: Start accepts. Automaton has 3474 states and 6869 transitions. Word has length 171 [2024-11-09 06:32:28,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:28,328 INFO L471 AbstractCegarLoop]: Abstraction has 3474 states and 6869 transitions. [2024-11-09 06:32:28,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 6869 transitions. [2024-11-09 06:32:28,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:28,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:28,332 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, 1, 1] [2024-11-09 06:32:28,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 06:32:28,333 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:28,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:28,334 INFO L85 PathProgramCache]: Analyzing trace with hash -602588561, now seen corresponding path program 15 times [2024-11-09 06:32:28,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:28,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398942214] [2024-11-09 06:32:28,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:28,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:28,927 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 06:32:28,927 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:28,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398942214] [2024-11-09 06:32:28,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398942214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:28,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:28,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:28,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252568919] [2024-11-09 06:32:28,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:28,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:28,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:28,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:28,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:28,930 INFO L87 Difference]: Start difference. First operand 3474 states and 6869 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:30,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:30,029 INFO L93 Difference]: Finished difference Result 11044 states and 22053 transitions. [2024-11-09 06:32:30,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:30,030 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:30,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:30,063 INFO L225 Difference]: With dead ends: 11044 [2024-11-09 06:32:30,063 INFO L226 Difference]: Without dead ends: 8424 [2024-11-09 06:32:30,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:32:30,070 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 460 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:30,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1707 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:32:30,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8424 states. [2024-11-09 06:32:30,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8424 to 3472. [2024-11-09 06:32:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3472 states, 3459 states have (on average 1.9846776525007228) internal successors, (6865), 3471 states have internal predecessors, (6865), 0 states have call successors, (0), 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 06:32:30,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 6865 transitions. [2024-11-09 06:32:30,222 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 6865 transitions. Word has length 171 [2024-11-09 06:32:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:30,223 INFO L471 AbstractCegarLoop]: Abstraction has 3472 states and 6865 transitions. [2024-11-09 06:32:30,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 6865 transitions. [2024-11-09 06:32:30,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:30,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:30,226 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, 1, 1] [2024-11-09 06:32:30,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 06:32:30,226 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:30,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:30,227 INFO L85 PathProgramCache]: Analyzing trace with hash -2022125659, now seen corresponding path program 16 times [2024-11-09 06:32:30,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:30,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193053798] [2024-11-09 06:32:30,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:30,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:30,800 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 06:32:30,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:30,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193053798] [2024-11-09 06:32:30,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193053798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:30,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:30,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:30,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153356113] [2024-11-09 06:32:30,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:30,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:30,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:30,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:30,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:30,803 INFO L87 Difference]: Start difference. First operand 3472 states and 6865 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:31,886 INFO L93 Difference]: Finished difference Result 10931 states and 21846 transitions. [2024-11-09 06:32:31,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:31,886 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:31,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:31,919 INFO L225 Difference]: With dead ends: 10931 [2024-11-09 06:32:31,919 INFO L226 Difference]: Without dead ends: 8311 [2024-11-09 06:32:31,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:32:31,927 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 478 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:31,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1706 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:32:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8311 states. [2024-11-09 06:32:32,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8311 to 3474. [2024-11-09 06:32:32,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3474 states, 3461 states have (on average 1.984686506789945) internal successors, (6869), 3473 states have internal predecessors, (6869), 0 states have call successors, (0), 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 06:32:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 6869 transitions. [2024-11-09 06:32:32,095 INFO L78 Accepts]: Start accepts. Automaton has 3474 states and 6869 transitions. Word has length 171 [2024-11-09 06:32:32,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:32,095 INFO L471 AbstractCegarLoop]: Abstraction has 3474 states and 6869 transitions. [2024-11-09 06:32:32,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 6869 transitions. [2024-11-09 06:32:32,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:32,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:32,098 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, 1, 1] [2024-11-09 06:32:32,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 06:32:32,099 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:32,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:32,099 INFO L85 PathProgramCache]: Analyzing trace with hash 310167853, now seen corresponding path program 17 times [2024-11-09 06:32:32,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:32,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295144945] [2024-11-09 06:32:32,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:32,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:32,637 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 06:32:32,637 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:32,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295144945] [2024-11-09 06:32:32,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295144945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:32,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:32,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:32,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316936526] [2024-11-09 06:32:32,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:32,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:32,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:32,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:32,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:32,640 INFO L87 Difference]: Start difference. First operand 3474 states and 6869 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:33,786 INFO L93 Difference]: Finished difference Result 10047 states and 20078 transitions. [2024-11-09 06:32:33,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:33,787 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:33,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:33,827 INFO L225 Difference]: With dead ends: 10047 [2024-11-09 06:32:33,828 INFO L226 Difference]: Without dead ends: 7427 [2024-11-09 06:32:33,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:32:33,836 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 397 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:33,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1494 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:32:33,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7427 states. [2024-11-09 06:32:34,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7427 to 3462. [2024-11-09 06:32:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3462 states, 3449 states have (on average 1.9846332270223253) internal successors, (6845), 3461 states have internal predecessors, (6845), 0 states have call successors, (0), 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 06:32:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 6845 transitions. [2024-11-09 06:32:34,068 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 6845 transitions. Word has length 171 [2024-11-09 06:32:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:34,069 INFO L471 AbstractCegarLoop]: Abstraction has 3462 states and 6845 transitions. [2024-11-09 06:32:34,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 6845 transitions. [2024-11-09 06:32:34,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:34,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:34,074 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, 1, 1] [2024-11-09 06:32:34,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 06:32:34,075 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:34,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:34,075 INFO L85 PathProgramCache]: Analyzing trace with hash 654366797, now seen corresponding path program 18 times [2024-11-09 06:32:34,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:34,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727562648] [2024-11-09 06:32:34,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:34,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:34,713 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 06:32:34,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:34,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727562648] [2024-11-09 06:32:34,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727562648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:34,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:34,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:34,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902708159] [2024-11-09 06:32:34,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:34,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:34,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:34,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:34,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:34,716 INFO L87 Difference]: Start difference. First operand 3462 states and 6845 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:35,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:35,604 INFO L93 Difference]: Finished difference Result 9715 states and 19452 transitions. [2024-11-09 06:32:35,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:35,604 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:35,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:35,643 INFO L225 Difference]: With dead ends: 9715 [2024-11-09 06:32:35,644 INFO L226 Difference]: Without dead ends: 7095 [2024-11-09 06:32:35,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:32:35,652 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 409 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:35,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1802 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:32:35,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7095 states. [2024-11-09 06:32:35,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7095 to 3474. [2024-11-09 06:32:35,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3474 states, 3461 states have (on average 1.984686506789945) internal successors, (6869), 3473 states have internal predecessors, (6869), 0 states have call successors, (0), 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 06:32:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 6869 transitions. [2024-11-09 06:32:35,841 INFO L78 Accepts]: Start accepts. Automaton has 3474 states and 6869 transitions. Word has length 171 [2024-11-09 06:32:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:35,842 INFO L471 AbstractCegarLoop]: Abstraction has 3474 states and 6869 transitions. [2024-11-09 06:32:35,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 6869 transitions. [2024-11-09 06:32:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:35,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:35,846 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, 1, 1] [2024-11-09 06:32:35,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 06:32:35,846 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:35,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:35,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1696541005, now seen corresponding path program 19 times [2024-11-09 06:32:35,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:35,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857172317] [2024-11-09 06:32:35,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:35,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:36,430 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 06:32:36,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:36,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857172317] [2024-11-09 06:32:36,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857172317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:36,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:36,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:36,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868989957] [2024-11-09 06:32:36,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:36,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:36,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:36,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:36,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:36,433 INFO L87 Difference]: Start difference. First operand 3474 states and 6869 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:37,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:37,203 INFO L93 Difference]: Finished difference Result 9781 states and 19565 transitions. [2024-11-09 06:32:37,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:37,203 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:37,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:37,237 INFO L225 Difference]: With dead ends: 9781 [2024-11-09 06:32:37,238 INFO L226 Difference]: Without dead ends: 7161 [2024-11-09 06:32:37,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:32:37,248 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 447 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:37,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1389 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:32:37,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7161 states. [2024-11-09 06:32:37,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7161 to 3472. [2024-11-09 06:32:37,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3472 states, 3459 states have (on average 1.9846776525007228) internal successors, (6865), 3471 states have internal predecessors, (6865), 0 states have call successors, (0), 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 06:32:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 6865 transitions. [2024-11-09 06:32:37,399 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 6865 transitions. Word has length 171 [2024-11-09 06:32:37,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:37,399 INFO L471 AbstractCegarLoop]: Abstraction has 3472 states and 6865 transitions. [2024-11-09 06:32:37,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:37,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 6865 transitions. [2024-11-09 06:32:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:37,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:37,403 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, 1, 1] [2024-11-09 06:32:37,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 06:32:37,404 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:37,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:37,404 INFO L85 PathProgramCache]: Analyzing trace with hash 277003907, now seen corresponding path program 20 times [2024-11-09 06:32:37,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:37,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167402762] [2024-11-09 06:32:37,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:37,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:37,932 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 06:32:37,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:37,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167402762] [2024-11-09 06:32:37,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167402762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:37,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:37,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:37,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340009477] [2024-11-09 06:32:37,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:37,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:37,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:37,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:37,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:37,935 INFO L87 Difference]: Start difference. First operand 3472 states and 6865 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:38,897 INFO L93 Difference]: Finished difference Result 10721 states and 21426 transitions. [2024-11-09 06:32:38,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:38,898 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:38,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:38,934 INFO L225 Difference]: With dead ends: 10721 [2024-11-09 06:32:38,934 INFO L226 Difference]: Without dead ends: 8101 [2024-11-09 06:32:38,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:32:38,942 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 475 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:38,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 1482 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:32:38,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8101 states. [2024-11-09 06:32:39,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8101 to 3474. [2024-11-09 06:32:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3474 states, 3461 states have (on average 1.984686506789945) internal successors, (6869), 3473 states have internal predecessors, (6869), 0 states have call successors, (0), 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 06:32:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 6869 transitions. [2024-11-09 06:32:39,086 INFO L78 Accepts]: Start accepts. Automaton has 3474 states and 6869 transitions. Word has length 171 [2024-11-09 06:32:39,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:39,087 INFO L471 AbstractCegarLoop]: Abstraction has 3474 states and 6869 transitions. [2024-11-09 06:32:39,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:39,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 6869 transitions. [2024-11-09 06:32:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:39,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:39,090 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, 1, 1] [2024-11-09 06:32:39,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 06:32:39,090 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:39,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:39,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1685669877, now seen corresponding path program 21 times [2024-11-09 06:32:39,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:39,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252271358] [2024-11-09 06:32:39,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:39,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:39,613 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 06:32:39,613 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:39,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252271358] [2024-11-09 06:32:39,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252271358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:39,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:39,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:39,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20986314] [2024-11-09 06:32:39,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:39,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:39,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:39,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:39,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:39,616 INFO L87 Difference]: Start difference. First operand 3474 states and 6869 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:40,542 INFO L93 Difference]: Finished difference Result 9847 states and 19678 transitions. [2024-11-09 06:32:40,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:40,543 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:40,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:40,582 INFO L225 Difference]: With dead ends: 9847 [2024-11-09 06:32:40,582 INFO L226 Difference]: Without dead ends: 7227 [2024-11-09 06:32:40,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:32:40,590 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 383 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:40,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1687 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:32:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7227 states. [2024-11-09 06:32:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7227 to 3468. [2024-11-09 06:32:40,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3468 states, 3455 states have (on average 1.98465991316932) internal successors, (6857), 3467 states have internal predecessors, (6857), 0 states have call successors, (0), 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 06:32:40,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3468 states to 3468 states and 6857 transitions. [2024-11-09 06:32:40,740 INFO L78 Accepts]: Start accepts. Automaton has 3468 states and 6857 transitions. Word has length 171 [2024-11-09 06:32:40,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:40,741 INFO L471 AbstractCegarLoop]: Abstraction has 3468 states and 6857 transitions. [2024-11-09 06:32:40,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:40,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3468 states and 6857 transitions. [2024-11-09 06:32:40,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:40,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:40,744 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, 1, 1] [2024-11-09 06:32:40,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 06:32:40,744 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:40,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:40,745 INFO L85 PathProgramCache]: Analyzing trace with hash 467544963, now seen corresponding path program 22 times [2024-11-09 06:32:40,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:40,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050873660] [2024-11-09 06:32:40,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:40,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:41,220 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 06:32:41,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:41,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050873660] [2024-11-09 06:32:41,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050873660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:41,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:41,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:41,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389311842] [2024-11-09 06:32:41,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:41,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:41,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:41,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:41,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:41,223 INFO L87 Difference]: Start difference. First operand 3468 states and 6857 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:42,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:42,358 INFO L93 Difference]: Finished difference Result 9659 states and 19340 transitions. [2024-11-09 06:32:42,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:42,359 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:42,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:42,411 INFO L225 Difference]: With dead ends: 9659 [2024-11-09 06:32:42,412 INFO L226 Difference]: Without dead ends: 7039 [2024-11-09 06:32:42,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:32:42,421 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 449 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:42,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1648 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:32:42,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7039 states. [2024-11-09 06:32:42,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7039 to 3473. [2024-11-09 06:32:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3473 states, 3460 states have (on average 1.9846820809248555) internal successors, (6867), 3472 states have internal predecessors, (6867), 0 states have call successors, (0), 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 06:32:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 6867 transitions. [2024-11-09 06:32:42,625 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 6867 transitions. Word has length 171 [2024-11-09 06:32:42,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:42,625 INFO L471 AbstractCegarLoop]: Abstraction has 3473 states and 6867 transitions. [2024-11-09 06:32:42,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 6867 transitions. [2024-11-09 06:32:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:42,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:42,627 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, 1, 1] [2024-11-09 06:32:42,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 06:32:42,628 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:42,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:42,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1495128821, now seen corresponding path program 23 times [2024-11-09 06:32:42,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:42,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62474058] [2024-11-09 06:32:42,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:42,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:43,247 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 06:32:43,247 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:43,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62474058] [2024-11-09 06:32:43,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62474058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:43,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:43,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:43,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941805737] [2024-11-09 06:32:43,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:43,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:43,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:43,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:43,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:43,250 INFO L87 Difference]: Start difference. First operand 3473 states and 6867 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:44,709 INFO L93 Difference]: Finished difference Result 9697 states and 19378 transitions. [2024-11-09 06:32:44,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:44,710 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:44,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:44,775 INFO L225 Difference]: With dead ends: 9697 [2024-11-09 06:32:44,775 INFO L226 Difference]: Without dead ends: 7077 [2024-11-09 06:32:44,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:32:44,786 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 362 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:44,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1672 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 06:32:44,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7077 states. [2024-11-09 06:32:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7077 to 3471. [2024-11-09 06:32:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3471 states, 3458 states have (on average 1.9846732215153269) internal successors, (6863), 3470 states have internal predecessors, (6863), 0 states have call successors, (0), 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 06:32:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 6863 transitions. [2024-11-09 06:32:44,987 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 6863 transitions. Word has length 171 [2024-11-09 06:32:44,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:44,988 INFO L471 AbstractCegarLoop]: Abstraction has 3471 states and 6863 transitions. [2024-11-09 06:32:44,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:44,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 6863 transitions. [2024-11-09 06:32:44,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:44,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:44,990 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, 1, 1] [2024-11-09 06:32:44,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 06:32:44,991 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:44,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:44,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1380582637, now seen corresponding path program 24 times [2024-11-09 06:32:44,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:44,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644352784] [2024-11-09 06:32:44,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:44,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:45,388 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 06:32:45,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:45,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644352784] [2024-11-09 06:32:45,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644352784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:45,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:45,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:45,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877863863] [2024-11-09 06:32:45,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:45,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:45,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:45,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:45,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:45,391 INFO L87 Difference]: Start difference. First operand 3471 states and 6863 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:46,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:46,334 INFO L93 Difference]: Finished difference Result 8707 states and 17436 transitions. [2024-11-09 06:32:46,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:46,335 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:46,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:46,387 INFO L225 Difference]: With dead ends: 8707 [2024-11-09 06:32:46,388 INFO L226 Difference]: Without dead ends: 6087 [2024-11-09 06:32:46,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:32:46,396 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 314 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:46,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1262 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:32:46,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6087 states. [2024-11-09 06:32:46,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6087 to 3528. [2024-11-09 06:32:46,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3528 states, 3515 states have (on average 1.9849217638691323) internal successors, (6977), 3527 states have internal predecessors, (6977), 0 states have call successors, (0), 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 06:32:46,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3528 states and 6977 transitions. [2024-11-09 06:32:46,595 INFO L78 Accepts]: Start accepts. Automaton has 3528 states and 6977 transitions. Word has length 171 [2024-11-09 06:32:46,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:46,596 INFO L471 AbstractCegarLoop]: Abstraction has 3528 states and 6977 transitions. [2024-11-09 06:32:46,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 6977 transitions. [2024-11-09 06:32:46,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:46,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:46,600 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, 1, 1] [2024-11-09 06:32:46,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 06:32:46,601 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:46,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:46,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1736990115, now seen corresponding path program 25 times [2024-11-09 06:32:46,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:46,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73413623] [2024-11-09 06:32:46,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:46,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:47,204 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 06:32:47,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:47,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73413623] [2024-11-09 06:32:47,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73413623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:47,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:47,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:47,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146790896] [2024-11-09 06:32:47,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:47,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:47,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:47,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:47,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:47,207 INFO L87 Difference]: Start difference. First operand 3528 states and 6977 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:48,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:48,443 INFO L93 Difference]: Finished difference Result 9659 states and 19360 transitions. [2024-11-09 06:32:48,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:48,444 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:48,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:48,497 INFO L225 Difference]: With dead ends: 9659 [2024-11-09 06:32:48,497 INFO L226 Difference]: Without dead ends: 7039 [2024-11-09 06:32:48,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:32:48,504 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 359 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:48,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1421 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:32:48,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7039 states. [2024-11-09 06:32:48,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7039 to 3543. [2024-11-09 06:32:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3543 states, 3530 states have (on average 1.984985835694051) internal successors, (7007), 3542 states have internal predecessors, (7007), 0 states have call successors, (0), 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 06:32:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 3543 states and 7007 transitions. [2024-11-09 06:32:48,693 INFO L78 Accepts]: Start accepts. Automaton has 3543 states and 7007 transitions. Word has length 171 [2024-11-09 06:32:48,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:48,694 INFO L471 AbstractCegarLoop]: Abstraction has 3543 states and 7007 transitions. [2024-11-09 06:32:48,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3543 states and 7007 transitions. [2024-11-09 06:32:48,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:48,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:48,696 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, 1, 1] [2024-11-09 06:32:48,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 06:32:48,697 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:48,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:48,697 INFO L85 PathProgramCache]: Analyzing trace with hash 307847133, now seen corresponding path program 26 times [2024-11-09 06:32:48,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:48,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272563391] [2024-11-09 06:32:48,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:48,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:49,138 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 06:32:49,138 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:49,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272563391] [2024-11-09 06:32:49,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272563391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:49,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:49,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:49,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349012497] [2024-11-09 06:32:49,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:49,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:49,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:49,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:49,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:49,140 INFO L87 Difference]: Start difference. First operand 3543 states and 7007 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:50,117 INFO L93 Difference]: Finished difference Result 8977 states and 17977 transitions. [2024-11-09 06:32:50,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:50,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:50,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:50,156 INFO L225 Difference]: With dead ends: 8977 [2024-11-09 06:32:50,156 INFO L226 Difference]: Without dead ends: 6357 [2024-11-09 06:32:50,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:32:50,161 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 464 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:50,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1289 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:32:50,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6357 states. [2024-11-09 06:32:50,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6357 to 3545. [2024-11-09 06:32:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3545 states, 3532 states have (on average 1.9849943374858436) internal successors, (7011), 3544 states have internal predecessors, (7011), 0 states have call successors, (0), 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 06:32:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3545 states to 3545 states and 7011 transitions. [2024-11-09 06:32:50,379 INFO L78 Accepts]: Start accepts. Automaton has 3545 states and 7011 transitions. Word has length 171 [2024-11-09 06:32:50,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:50,380 INFO L471 AbstractCegarLoop]: Abstraction has 3545 states and 7011 transitions. [2024-11-09 06:32:50,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3545 states and 7011 transitions. [2024-11-09 06:32:50,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:50,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:50,383 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, 1, 1] [2024-11-09 06:32:50,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-09 06:32:50,384 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:50,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:50,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1654826651, now seen corresponding path program 27 times [2024-11-09 06:32:50,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:50,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541477668] [2024-11-09 06:32:50,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:50,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:50,771 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 06:32:50,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:50,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541477668] [2024-11-09 06:32:50,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541477668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:50,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:50,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:50,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894979716] [2024-11-09 06:32:50,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:50,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:50,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:50,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:50,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:50,774 INFO L87 Difference]: Start difference. First operand 3545 states and 7011 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:51,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:51,847 INFO L93 Difference]: Finished difference Result 9015 states and 18015 transitions. [2024-11-09 06:32:51,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:51,847 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:51,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:51,886 INFO L225 Difference]: With dead ends: 9015 [2024-11-09 06:32:51,886 INFO L226 Difference]: Without dead ends: 6395 [2024-11-09 06:32:51,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:32:51,893 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 349 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:51,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1708 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:32:51,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6395 states. [2024-11-09 06:32:52,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6395 to 3540. [2024-11-09 06:32:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3540 states, 3527 states have (on average 1.9849730649277006) internal successors, (7001), 3539 states have internal predecessors, (7001), 0 states have call successors, (0), 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 06:32:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3540 states to 3540 states and 7001 transitions. [2024-11-09 06:32:52,085 INFO L78 Accepts]: Start accepts. Automaton has 3540 states and 7001 transitions. Word has length 171 [2024-11-09 06:32:52,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:52,085 INFO L471 AbstractCegarLoop]: Abstraction has 3540 states and 7001 transitions. [2024-11-09 06:32:52,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:52,086 INFO L276 IsEmpty]: Start isEmpty. Operand 3540 states and 7001 transitions. [2024-11-09 06:32:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:52,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:52,088 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, 1, 1] [2024-11-09 06:32:52,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-09 06:32:52,088 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:52,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:52,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1398898229, now seen corresponding path program 28 times [2024-11-09 06:32:52,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:52,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807306333] [2024-11-09 06:32:52,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:52,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:52,473 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 06:32:52,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:52,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807306333] [2024-11-09 06:32:52,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807306333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:52,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:52,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:52,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613985084] [2024-11-09 06:32:52,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:52,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:52,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:52,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:52,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:52,475 INFO L87 Difference]: Start difference. First operand 3540 states and 7001 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:53,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:53,696 INFO L93 Difference]: Finished difference Result 8798 states and 17657 transitions. [2024-11-09 06:32:53,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:53,697 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:53,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:53,734 INFO L225 Difference]: With dead ends: 8798 [2024-11-09 06:32:53,734 INFO L226 Difference]: Without dead ends: 6178 [2024-11-09 06:32:53,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:32:53,740 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 357 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:53,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1662 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:32:53,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6178 states. [2024-11-09 06:32:53,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6178 to 3597. [2024-11-09 06:32:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3597 states, 3584 states have (on average 1.9852120535714286) internal successors, (7115), 3596 states have internal predecessors, (7115), 0 states have call successors, (0), 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 06:32:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 7115 transitions. [2024-11-09 06:32:53,913 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 7115 transitions. Word has length 171 [2024-11-09 06:32:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:53,914 INFO L471 AbstractCegarLoop]: Abstraction has 3597 states and 7115 transitions. [2024-11-09 06:32:53,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 7115 transitions. [2024-11-09 06:32:53,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:53,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:53,916 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, 1, 1] [2024-11-09 06:32:53,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-09 06:32:53,917 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:53,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:53,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1450156011, now seen corresponding path program 29 times [2024-11-09 06:32:53,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:53,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76797354] [2024-11-09 06:32:53,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:53,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:54,328 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 06:32:54,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:54,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76797354] [2024-11-09 06:32:54,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76797354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:54,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:54,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:54,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348232364] [2024-11-09 06:32:54,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:54,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:54,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:54,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:54,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:54,330 INFO L87 Difference]: Start difference. First operand 3597 states and 7115 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:55,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:55,432 INFO L93 Difference]: Finished difference Result 9319 states and 18642 transitions. [2024-11-09 06:32:55,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:55,433 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:55,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:55,473 INFO L225 Difference]: With dead ends: 9319 [2024-11-09 06:32:55,473 INFO L226 Difference]: Without dead ends: 6699 [2024-11-09 06:32:55,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:32:55,480 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 350 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:55,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1519 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:32:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6699 states. [2024-11-09 06:32:55,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6699 to 3606. [2024-11-09 06:32:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3606 states, 3593 states have (on average 1.985249095463401) internal successors, (7133), 3605 states have internal predecessors, (7133), 0 states have call successors, (0), 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 06:32:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3606 states to 3606 states and 7133 transitions. [2024-11-09 06:32:55,640 INFO L78 Accepts]: Start accepts. Automaton has 3606 states and 7133 transitions. Word has length 171 [2024-11-09 06:32:55,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:55,641 INFO L471 AbstractCegarLoop]: Abstraction has 3606 states and 7133 transitions. [2024-11-09 06:32:55,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:55,641 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 7133 transitions. [2024-11-09 06:32:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:55,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:55,644 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, 1, 1] [2024-11-09 06:32:55,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-09 06:32:55,644 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:55,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:55,645 INFO L85 PathProgramCache]: Analyzing trace with hash 594681237, now seen corresponding path program 30 times [2024-11-09 06:32:55,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:55,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461157052] [2024-11-09 06:32:55,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:55,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:56,270 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 06:32:56,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:56,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461157052] [2024-11-09 06:32:56,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461157052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:56,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:56,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:56,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924444225] [2024-11-09 06:32:56,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:56,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:56,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:56,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:56,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:56,274 INFO L87 Difference]: Start difference. First operand 3606 states and 7133 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:57,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:57,589 INFO L93 Difference]: Finished difference Result 10183 states and 20351 transitions. [2024-11-09 06:32:57,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:57,590 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:57,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:57,636 INFO L225 Difference]: With dead ends: 10183 [2024-11-09 06:32:57,636 INFO L226 Difference]: Without dead ends: 7563 [2024-11-09 06:32:57,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:32:57,643 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 466 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:57,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1359 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:32:57,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7563 states. [2024-11-09 06:32:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7563 to 3608. [2024-11-09 06:32:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3608 states, 3595 states have (on average 1.9852573018080668) internal successors, (7137), 3607 states have internal predecessors, (7137), 0 states have call successors, (0), 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 06:32:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3608 states to 3608 states and 7137 transitions. [2024-11-09 06:32:57,819 INFO L78 Accepts]: Start accepts. Automaton has 3608 states and 7137 transitions. Word has length 171 [2024-11-09 06:32:57,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:57,819 INFO L471 AbstractCegarLoop]: Abstraction has 3608 states and 7137 transitions. [2024-11-09 06:32:57,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3608 states and 7137 transitions. [2024-11-09 06:32:57,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:57,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:57,822 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, 1, 1] [2024-11-09 06:32:57,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-09 06:32:57,823 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:57,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:57,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1367992547, now seen corresponding path program 31 times [2024-11-09 06:32:57,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:57,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784378335] [2024-11-09 06:32:57,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:57,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:58,269 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 06:32:58,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:32:58,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784378335] [2024-11-09 06:32:58,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784378335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:32:58,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:32:58,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:32:58,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246078103] [2024-11-09 06:32:58,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:32:58,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:32:58,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:32:58,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:32:58,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:32:58,272 INFO L87 Difference]: Start difference. First operand 3608 states and 7137 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:59,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:59,337 INFO L93 Difference]: Finished difference Result 9432 states and 18811 transitions. [2024-11-09 06:32:59,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:32:59,337 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:32:59,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:59,382 INFO L225 Difference]: With dead ends: 9432 [2024-11-09 06:32:59,382 INFO L226 Difference]: Without dead ends: 6812 [2024-11-09 06:32:59,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:32:59,389 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 360 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:59,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1650 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:32:59,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6812 states. [2024-11-09 06:32:59,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6812 to 3603. [2024-11-09 06:32:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3603 states, 3590 states have (on average 1.9852367688022283) internal successors, (7127), 3602 states have internal predecessors, (7127), 0 states have call successors, (0), 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 06:32:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 3603 states and 7127 transitions. [2024-11-09 06:32:59,561 INFO L78 Accepts]: Start accepts. Automaton has 3603 states and 7127 transitions. Word has length 171 [2024-11-09 06:32:59,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:59,561 INFO L471 AbstractCegarLoop]: Abstraction has 3603 states and 7127 transitions. [2024-11-09 06:32:59,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:32:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3603 states and 7127 transitions. [2024-11-09 06:32:59,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:32:59,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:59,566 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, 1, 1] [2024-11-09 06:32:59,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-09 06:32:59,566 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:32:59,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:59,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1162482667, now seen corresponding path program 32 times [2024-11-09 06:32:59,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:32:59,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96153997] [2024-11-09 06:32:59,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:59,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:32:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:00,151 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 06:33:00,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:00,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96153997] [2024-11-09 06:33:00,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96153997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:00,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:00,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:33:00,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586732451] [2024-11-09 06:33:00,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:00,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:33:00,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:00,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:33:00,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:33:00,154 INFO L87 Difference]: Start difference. First operand 3603 states and 7127 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:01,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:01,067 INFO L93 Difference]: Finished difference Result 9940 states and 19884 transitions. [2024-11-09 06:33:01,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:33:01,067 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:33:01,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:01,113 INFO L225 Difference]: With dead ends: 9940 [2024-11-09 06:33:01,113 INFO L226 Difference]: Without dead ends: 7320 [2024-11-09 06:33:01,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:33:01,120 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 463 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:01,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1446 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:33:01,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7320 states. [2024-11-09 06:33:01,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7320 to 3609. [2024-11-09 06:33:01,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3609 states, 3596 states have (on average 1.9852614015572858) internal successors, (7139), 3608 states have internal predecessors, (7139), 0 states have call successors, (0), 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 06:33:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 3609 states and 7139 transitions. [2024-11-09 06:33:01,301 INFO L78 Accepts]: Start accepts. Automaton has 3609 states and 7139 transitions. Word has length 171 [2024-11-09 06:33:01,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:01,302 INFO L471 AbstractCegarLoop]: Abstraction has 3609 states and 7139 transitions. [2024-11-09 06:33:01,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:01,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 7139 transitions. [2024-11-09 06:33:01,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:33:01,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:01,304 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, 1, 1] [2024-11-09 06:33:01,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-09 06:33:01,304 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:33:01,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:01,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1169810845, now seen corresponding path program 33 times [2024-11-09 06:33:01,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:01,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783063760] [2024-11-09 06:33:01,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:01,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:01,691 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 06:33:01,691 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:01,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783063760] [2024-11-09 06:33:01,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783063760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:01,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:01,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:33:01,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099708318] [2024-11-09 06:33:01,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:01,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:33:01,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:01,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:33:01,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:33:01,694 INFO L87 Difference]: Start difference. First operand 3609 states and 7139 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:02,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:02,802 INFO L93 Difference]: Finished difference Result 9172 states and 18310 transitions. [2024-11-09 06:33:02,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:33:02,803 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:33:02,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:02,848 INFO L225 Difference]: With dead ends: 9172 [2024-11-09 06:33:02,848 INFO L226 Difference]: Without dead ends: 6552 [2024-11-09 06:33:02,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:33:02,855 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 368 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:02,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1847 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:33:02,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6552 states. [2024-11-09 06:33:02,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6552 to 3607. [2024-11-09 06:33:02,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3607 states, 3594 states have (on average 1.9852531997774068) internal successors, (7135), 3606 states have internal predecessors, (7135), 0 states have call successors, (0), 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 06:33:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3607 states to 3607 states and 7135 transitions. [2024-11-09 06:33:03,044 INFO L78 Accepts]: Start accepts. Automaton has 3607 states and 7135 transitions. Word has length 171 [2024-11-09 06:33:03,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:03,045 INFO L471 AbstractCegarLoop]: Abstraction has 3607 states and 7135 transitions. [2024-11-09 06:33:03,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:03,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3607 states and 7135 transitions. [2024-11-09 06:33:03,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:33:03,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:03,048 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, 1, 1] [2024-11-09 06:33:03,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-09 06:33:03,049 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:33:03,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:03,049 INFO L85 PathProgramCache]: Analyzing trace with hash -568739789, now seen corresponding path program 34 times [2024-11-09 06:33:03,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:03,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735390748] [2024-11-09 06:33:03,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:03,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:03,643 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 06:33:03,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:03,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735390748] [2024-11-09 06:33:03,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735390748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:03,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:03,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:33:03,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572028797] [2024-11-09 06:33:03,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:03,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:33:03,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:03,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:33:03,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:33:03,646 INFO L87 Difference]: Start difference. First operand 3607 states and 7135 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:04,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:04,637 INFO L93 Difference]: Finished difference Result 9086 states and 18176 transitions. [2024-11-09 06:33:04,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:33:04,638 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:33:04,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:04,686 INFO L225 Difference]: With dead ends: 9086 [2024-11-09 06:33:04,687 INFO L226 Difference]: Without dead ends: 6466 [2024-11-09 06:33:04,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:33:04,693 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 435 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:04,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1511 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:33:04,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6466 states. [2024-11-09 06:33:04,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6466 to 3609. [2024-11-09 06:33:04,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3609 states, 3596 states have (on average 1.9852614015572858) internal successors, (7139), 3608 states have internal predecessors, (7139), 0 states have call successors, (0), 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 06:33:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 3609 states and 7139 transitions. [2024-11-09 06:33:04,865 INFO L78 Accepts]: Start accepts. Automaton has 3609 states and 7139 transitions. Word has length 171 [2024-11-09 06:33:04,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:04,866 INFO L471 AbstractCegarLoop]: Abstraction has 3609 states and 7139 transitions. [2024-11-09 06:33:04,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:04,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 7139 transitions. [2024-11-09 06:33:04,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:33:04,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:04,869 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, 1, 1] [2024-11-09 06:33:04,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-09 06:33:04,869 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:33:04,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:04,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1523078975, now seen corresponding path program 35 times [2024-11-09 06:33:04,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:04,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205635020] [2024-11-09 06:33:04,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:04,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:05,223 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 06:33:05,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:05,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205635020] [2024-11-09 06:33:05,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205635020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:05,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:05,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:33:05,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343595218] [2024-11-09 06:33:05,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:05,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:33:05,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:05,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:33:05,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:33:05,226 INFO L87 Difference]: Start difference. First operand 3609 states and 7139 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:06,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:06,081 INFO L93 Difference]: Finished difference Result 8182 states and 16368 transitions. [2024-11-09 06:33:06,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:33:06,081 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:33:06,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:06,131 INFO L225 Difference]: With dead ends: 8182 [2024-11-09 06:33:06,131 INFO L226 Difference]: Without dead ends: 5562 [2024-11-09 06:33:06,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:33:06,138 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 311 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:06,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1420 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:33:06,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2024-11-09 06:33:06,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 3597. [2024-11-09 06:33:06,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3597 states, 3584 states have (on average 1.9852120535714286) internal successors, (7115), 3596 states have internal predecessors, (7115), 0 states have call successors, (0), 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 06:33:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 7115 transitions. [2024-11-09 06:33:06,490 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 7115 transitions. Word has length 171 [2024-11-09 06:33:06,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:06,491 INFO L471 AbstractCegarLoop]: Abstraction has 3597 states and 7115 transitions. [2024-11-09 06:33:06,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:06,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 7115 transitions. [2024-11-09 06:33:06,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:33:06,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:06,494 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, 1, 1] [2024-11-09 06:33:06,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-09 06:33:06,495 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:33:06,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:06,496 INFO L85 PathProgramCache]: Analyzing trace with hash -898270951, now seen corresponding path program 36 times [2024-11-09 06:33:06,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:06,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207206974] [2024-11-09 06:33:06,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:06,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:06,964 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 06:33:06,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:06,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207206974] [2024-11-09 06:33:06,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207206974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:06,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:06,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:33:06,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814334226] [2024-11-09 06:33:06,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:06,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:33:06,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:06,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:33:06,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:33:06,967 INFO L87 Difference]: Start difference. First operand 3597 states and 7115 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:08,365 INFO L93 Difference]: Finished difference Result 9529 states and 19062 transitions. [2024-11-09 06:33:08,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:33:08,365 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:33:08,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:08,418 INFO L225 Difference]: With dead ends: 9529 [2024-11-09 06:33:08,418 INFO L226 Difference]: Without dead ends: 6909 [2024-11-09 06:33:08,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:33:08,425 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 352 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:08,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1720 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 06:33:08,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6909 states. [2024-11-09 06:33:08,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6909 to 3611. [2024-11-09 06:33:08,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3611 states, 3598 states have (on average 1.9852695942190106) internal successors, (7143), 3610 states have internal predecessors, (7143), 0 states have call successors, (0), 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 06:33:08,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3611 states to 3611 states and 7143 transitions. [2024-11-09 06:33:08,611 INFO L78 Accepts]: Start accepts. Automaton has 3611 states and 7143 transitions. Word has length 171 [2024-11-09 06:33:08,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:08,612 INFO L471 AbstractCegarLoop]: Abstraction has 3611 states and 7143 transitions. [2024-11-09 06:33:08,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:08,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3611 states and 7143 transitions. [2024-11-09 06:33:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:33:08,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:08,614 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, 1, 1] [2024-11-09 06:33:08,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-09 06:33:08,614 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:33:08,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:08,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1146566297, now seen corresponding path program 37 times [2024-11-09 06:33:08,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:08,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270920549] [2024-11-09 06:33:08,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:08,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:08,969 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 06:33:08,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:08,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270920549] [2024-11-09 06:33:08,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270920549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:08,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:08,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:33:08,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003878541] [2024-11-09 06:33:08,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:08,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:33:08,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:08,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:33:08,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:33:08,972 INFO L87 Difference]: Start difference. First operand 3611 states and 7143 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:10,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:10,426 INFO L93 Difference]: Finished difference Result 10393 states and 20771 transitions. [2024-11-09 06:33:10,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:33:10,427 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:33:10,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:10,495 INFO L225 Difference]: With dead ends: 10393 [2024-11-09 06:33:10,495 INFO L226 Difference]: Without dead ends: 7773 [2024-11-09 06:33:10,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:33:10,506 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 435 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:10,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1707 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:33:10,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7773 states. [2024-11-09 06:33:10,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7773 to 3613. [2024-11-09 06:33:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3613 states, 3600 states have (on average 1.9852777777777777) internal successors, (7147), 3612 states have internal predecessors, (7147), 0 states have call successors, (0), 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 06:33:10,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3613 states to 3613 states and 7147 transitions. [2024-11-09 06:33:10,783 INFO L78 Accepts]: Start accepts. Automaton has 3613 states and 7147 transitions. Word has length 171 [2024-11-09 06:33:10,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:10,783 INFO L471 AbstractCegarLoop]: Abstraction has 3613 states and 7147 transitions. [2024-11-09 06:33:10,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:10,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3613 states and 7147 transitions. [2024-11-09 06:33:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:33:10,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:10,787 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, 1, 1] [2024-11-09 06:33:10,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-09 06:33:10,788 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:33:10,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:10,788 INFO L85 PathProgramCache]: Analyzing trace with hash -816107487, now seen corresponding path program 38 times [2024-11-09 06:33:10,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:10,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882577523] [2024-11-09 06:33:10,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:10,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:11,364 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 06:33:11,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:11,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882577523] [2024-11-09 06:33:11,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882577523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:11,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:11,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:33:11,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98214514] [2024-11-09 06:33:11,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:11,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:33:11,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:11,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:33:11,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:33:11,367 INFO L87 Difference]: Start difference. First operand 3613 states and 7147 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:12,550 INFO L93 Difference]: Finished difference Result 9642 states and 19231 transitions. [2024-11-09 06:33:12,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:33:12,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:33:12,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:12,605 INFO L225 Difference]: With dead ends: 9642 [2024-11-09 06:33:12,605 INFO L226 Difference]: Without dead ends: 7022 [2024-11-09 06:33:12,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:33:12,613 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 358 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:12,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1644 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:33:12,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7022 states. [2024-11-09 06:33:12,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7022 to 3608. [2024-11-09 06:33:12,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3608 states, 3595 states have (on average 1.9852573018080668) internal successors, (7137), 3607 states have internal predecessors, (7137), 0 states have call successors, (0), 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 06:33:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3608 states to 3608 states and 7137 transitions. [2024-11-09 06:33:12,863 INFO L78 Accepts]: Start accepts. Automaton has 3608 states and 7137 transitions. Word has length 171 [2024-11-09 06:33:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:12,863 INFO L471 AbstractCegarLoop]: Abstraction has 3608 states and 7137 transitions. [2024-11-09 06:33:12,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3608 states and 7137 transitions. [2024-11-09 06:33:12,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:33:12,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:12,866 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, 1, 1] [2024-11-09 06:33:12,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-09 06:33:12,866 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:33:12,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:12,866 INFO L85 PathProgramCache]: Analyzing trace with hash -610597607, now seen corresponding path program 39 times [2024-11-09 06:33:12,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:12,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897184915] [2024-11-09 06:33:12,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:12,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:13,258 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 06:33:13,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:13,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897184915] [2024-11-09 06:33:13,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897184915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:13,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:13,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:33:13,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488895702] [2024-11-09 06:33:13,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:13,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:33:13,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:13,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:33:13,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:33:13,261 INFO L87 Difference]: Start difference. First operand 3608 states and 7137 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:14,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:14,355 INFO L93 Difference]: Finished difference Result 11398 states and 22762 transitions. [2024-11-09 06:33:14,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:33:14,356 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:33:14,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:14,435 INFO L225 Difference]: With dead ends: 11398 [2024-11-09 06:33:14,435 INFO L226 Difference]: Without dead ends: 8778 [2024-11-09 06:33:14,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:33:14,445 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 490 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:14,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1517 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:33:14,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8778 states. [2024-11-09 06:33:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8778 to 3614. [2024-11-09 06:33:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3614 states, 3601 states have (on average 1.985281866148292) internal successors, (7149), 3613 states have internal predecessors, (7149), 0 states have call successors, (0), 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 06:33:14,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 7149 transitions. [2024-11-09 06:33:14,666 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 7149 transitions. Word has length 171 [2024-11-09 06:33:14,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:14,667 INFO L471 AbstractCegarLoop]: Abstraction has 3614 states and 7149 transitions. [2024-11-09 06:33:14,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:14,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 7149 transitions. [2024-11-09 06:33:14,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:33:14,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:14,669 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, 1, 1] [2024-11-09 06:33:14,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-09 06:33:14,670 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:33:14,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:14,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1721695905, now seen corresponding path program 40 times [2024-11-09 06:33:14,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:14,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207544922] [2024-11-09 06:33:14,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:14,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:15,280 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 06:33:15,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:15,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207544922] [2024-11-09 06:33:15,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207544922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:15,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:15,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:33:15,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827358769] [2024-11-09 06:33:15,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:15,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:33:15,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:15,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:33:15,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:33:15,283 INFO L87 Difference]: Start difference. First operand 3614 states and 7149 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:16,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:16,442 INFO L93 Difference]: Finished difference Result 10630 states and 21188 transitions. [2024-11-09 06:33:16,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:33:16,443 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:33:16,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:16,500 INFO L225 Difference]: With dead ends: 10630 [2024-11-09 06:33:16,500 INFO L226 Difference]: Without dead ends: 8010 [2024-11-09 06:33:16,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:33:16,508 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 395 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1826 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:16,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1826 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:33:16,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8010 states. [2024-11-09 06:33:16,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8010 to 3612. [2024-11-09 06:33:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3612 states, 3599 states have (on average 1.9852736871353154) internal successors, (7145), 3611 states have internal predecessors, (7145), 0 states have call successors, (0), 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 06:33:16,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3612 states to 3612 states and 7145 transitions. [2024-11-09 06:33:16,710 INFO L78 Accepts]: Start accepts. Automaton has 3612 states and 7145 transitions. Word has length 171 [2024-11-09 06:33:16,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:16,710 INFO L471 AbstractCegarLoop]: Abstraction has 3612 states and 7145 transitions. [2024-11-09 06:33:16,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:16,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3612 states and 7145 transitions. [2024-11-09 06:33:16,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:33:16,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:16,713 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, 1, 1] [2024-11-09 06:33:16,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-09 06:33:16,713 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:33:16,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:16,714 INFO L85 PathProgramCache]: Analyzing trace with hash -16854729, now seen corresponding path program 41 times [2024-11-09 06:33:16,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:16,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933574761] [2024-11-09 06:33:16,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:16,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:17,159 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 06:33:17,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:17,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933574761] [2024-11-09 06:33:17,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933574761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:17,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:17,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:33:17,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210795169] [2024-11-09 06:33:17,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:17,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:33:17,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:17,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:33:17,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:33:17,162 INFO L87 Difference]: Start difference. First operand 3612 states and 7145 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:18,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:18,400 INFO L93 Difference]: Finished difference Result 10544 states and 21054 transitions. [2024-11-09 06:33:18,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:33:18,401 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:33:18,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:18,462 INFO L225 Difference]: With dead ends: 10544 [2024-11-09 06:33:18,462 INFO L226 Difference]: Without dead ends: 7924 [2024-11-09 06:33:18,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:33:18,470 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 415 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:18,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1858 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:33:18,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7924 states. [2024-11-09 06:33:18,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7924 to 3614. [2024-11-09 06:33:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3614 states, 3601 states have (on average 1.985281866148292) internal successors, (7149), 3613 states have internal predecessors, (7149), 0 states have call successors, (0), 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 06:33:18,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 7149 transitions. [2024-11-09 06:33:18,827 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 7149 transitions. Word has length 171 [2024-11-09 06:33:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:18,828 INFO L471 AbstractCegarLoop]: Abstraction has 3614 states and 7149 transitions. [2024-11-09 06:33:18,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:18,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 7149 transitions. [2024-11-09 06:33:18,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:33:18,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:18,830 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, 1, 1] [2024-11-09 06:33:18,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-09 06:33:18,831 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:33:18,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:18,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2074964035, now seen corresponding path program 42 times [2024-11-09 06:33:18,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:18,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143685172] [2024-11-09 06:33:18,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:18,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:19,248 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 06:33:19,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:19,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143685172] [2024-11-09 06:33:19,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143685172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:19,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:19,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:33:19,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693715137] [2024-11-09 06:33:19,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:19,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:33:19,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:19,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:33:19,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:33:19,250 INFO L87 Difference]: Start difference. First operand 3614 states and 7149 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:20,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:20,313 INFO L93 Difference]: Finished difference Result 9660 states and 19286 transitions. [2024-11-09 06:33:20,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:33:20,314 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:33:20,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:20,373 INFO L225 Difference]: With dead ends: 9660 [2024-11-09 06:33:20,373 INFO L226 Difference]: Without dead ends: 7040 [2024-11-09 06:33:20,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:33:20,382 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 324 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:20,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1770 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:33:20,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7040 states. [2024-11-09 06:33:20,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7040 to 3602. [2024-11-09 06:33:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3602 states, 3589 states have (on average 1.9852326553357482) internal successors, (7125), 3601 states have internal predecessors, (7125), 0 states have call successors, (0), 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 06:33:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3602 states to 3602 states and 7125 transitions. [2024-11-09 06:33:20,804 INFO L78 Accepts]: Start accepts. Automaton has 3602 states and 7125 transitions. Word has length 171 [2024-11-09 06:33:20,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:20,804 INFO L471 AbstractCegarLoop]: Abstraction has 3602 states and 7125 transitions. [2024-11-09 06:33:20,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:20,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3602 states and 7125 transitions. [2024-11-09 06:33:20,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:33:20,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:20,808 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, 1, 1] [2024-11-09 06:33:20,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-09 06:33:20,808 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:33:20,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:20,809 INFO L85 PathProgramCache]: Analyzing trace with hash 314428847, now seen corresponding path program 43 times [2024-11-09 06:33:20,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:20,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263647254] [2024-11-09 06:33:20,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:20,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:21,389 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 06:33:21,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:21,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263647254] [2024-11-09 06:33:21,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263647254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:21,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:21,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:33:21,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908447741] [2024-11-09 06:33:21,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:21,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:33:21,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:21,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:33:21,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:33:21,393 INFO L87 Difference]: Start difference. First operand 3602 states and 7125 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:22,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:22,608 INFO L93 Difference]: Finished difference Result 9263 states and 18530 transitions. [2024-11-09 06:33:22,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:33:22,609 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:33:22,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:22,707 INFO L225 Difference]: With dead ends: 9263 [2024-11-09 06:33:22,707 INFO L226 Difference]: Without dead ends: 6643 [2024-11-09 06:33:22,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:33:22,720 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 393 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:22,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1294 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:33:22,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6643 states. [2024-11-09 06:33:22,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6643 to 3611. [2024-11-09 06:33:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3611 states, 3598 states have (on average 1.9852695942190106) internal successors, (7143), 3610 states have internal predecessors, (7143), 0 states have call successors, (0), 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 06:33:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3611 states to 3611 states and 7143 transitions. [2024-11-09 06:33:23,087 INFO L78 Accepts]: Start accepts. Automaton has 3611 states and 7143 transitions. Word has length 171 [2024-11-09 06:33:23,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:23,088 INFO L471 AbstractCegarLoop]: Abstraction has 3611 states and 7143 transitions. [2024-11-09 06:33:23,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3611 states and 7143 transitions. [2024-11-09 06:33:23,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:33:23,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:23,092 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, 1, 1] [2024-11-09 06:33:23,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-09 06:33:23,092 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:33:23,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:23,093 INFO L85 PathProgramCache]: Analyzing trace with hash -441769229, now seen corresponding path program 44 times [2024-11-09 06:33:23,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:23,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763399510] [2024-11-09 06:33:23,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:23,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:23,672 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 06:33:23,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:23,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763399510] [2024-11-09 06:33:23,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763399510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:23,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:23,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:33:23,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2940393] [2024-11-09 06:33:23,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:23,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:33:23,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:23,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:33:23,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:33:23,674 INFO L87 Difference]: Start difference. First operand 3611 states and 7143 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:24,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:24,929 INFO L93 Difference]: Finished difference Result 10108 states and 20201 transitions. [2024-11-09 06:33:24,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:33:24,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:33:24,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:24,996 INFO L225 Difference]: With dead ends: 10108 [2024-11-09 06:33:24,996 INFO L226 Difference]: Without dead ends: 7488 [2024-11-09 06:33:25,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:33:25,008 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 363 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:25,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1461 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:33:25,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7488 states. [2024-11-09 06:33:25,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7488 to 3613. [2024-11-09 06:33:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3613 states, 3600 states have (on average 1.9852777777777777) internal successors, (7147), 3612 states have internal predecessors, (7147), 0 states have call successors, (0), 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 06:33:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3613 states to 3613 states and 7147 transitions. [2024-11-09 06:33:25,247 INFO L78 Accepts]: Start accepts. Automaton has 3613 states and 7147 transitions. Word has length 171 [2024-11-09 06:33:25,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:25,248 INFO L471 AbstractCegarLoop]: Abstraction has 3613 states and 7147 transitions. [2024-11-09 06:33:25,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3613 states and 7147 transitions. [2024-11-09 06:33:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:33:25,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:25,250 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, 1, 1] [2024-11-09 06:33:25,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-09 06:33:25,251 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:33:25,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:25,251 INFO L85 PathProgramCache]: Analyzing trace with hash 600404979, now seen corresponding path program 45 times [2024-11-09 06:33:25,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:25,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565130300] [2024-11-09 06:33:25,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:25,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:25,619 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 06:33:25,620 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:25,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565130300] [2024-11-09 06:33:25,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565130300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:25,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:25,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:33:25,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799162596] [2024-11-09 06:33:25,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:25,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:33:25,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:25,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:33:25,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:33:25,622 INFO L87 Difference]: Start difference. First operand 3613 states and 7147 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:26,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:26,706 INFO L93 Difference]: Finished difference Result 9319 states and 18623 transitions. [2024-11-09 06:33:26,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:33:26,707 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:33:26,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:26,770 INFO L225 Difference]: With dead ends: 9319 [2024-11-09 06:33:26,770 INFO L226 Difference]: Without dead ends: 6699 [2024-11-09 06:33:26,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:33:26,779 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 361 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:26,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1440 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:33:26,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6699 states. [2024-11-09 06:33:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6699 to 3608. [2024-11-09 06:33:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3608 states, 3595 states have (on average 1.9852573018080668) internal successors, (7137), 3607 states have internal predecessors, (7137), 0 states have call successors, (0), 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 06:33:26,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3608 states to 3608 states and 7137 transitions. [2024-11-09 06:33:26,991 INFO L78 Accepts]: Start accepts. Automaton has 3608 states and 7137 transitions. Word has length 171 [2024-11-09 06:33:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:26,992 INFO L471 AbstractCegarLoop]: Abstraction has 3608 states and 7137 transitions. [2024-11-09 06:33:26,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3608 states and 7137 transitions. [2024-11-09 06:33:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:33:26,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:26,994 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, 1, 1] [2024-11-09 06:33:26,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-09 06:33:26,995 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:33:26,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:26,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1928086955, now seen corresponding path program 46 times [2024-11-09 06:33:26,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:26,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305966548] [2024-11-09 06:33:26,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:26,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:27,516 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 06:33:27,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:27,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305966548] [2024-11-09 06:33:27,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305966548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:27,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:27,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:33:27,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554027727] [2024-11-09 06:33:27,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:27,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:33:27,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:27,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:33:27,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:33:27,518 INFO L87 Difference]: Start difference. First operand 3608 states and 7137 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:28,617 INFO L93 Difference]: Finished difference Result 9517 states and 19000 transitions. [2024-11-09 06:33:28,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:33:28,617 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:33:28,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:28,677 INFO L225 Difference]: With dead ends: 9517 [2024-11-09 06:33:28,677 INFO L226 Difference]: Without dead ends: 6897 [2024-11-09 06:33:28,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:33:28,685 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 381 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:28,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1671 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:33:28,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6897 states. [2024-11-09 06:33:28,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6897 to 3614. [2024-11-09 06:33:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3614 states, 3601 states have (on average 1.985281866148292) internal successors, (7149), 3613 states have internal predecessors, (7149), 0 states have call successors, (0), 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 06:33:28,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 7149 transitions. [2024-11-09 06:33:28,904 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 7149 transitions. Word has length 171 [2024-11-09 06:33:28,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:28,904 INFO L471 AbstractCegarLoop]: Abstraction has 3614 states and 7149 transitions. [2024-11-09 06:33:28,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:28,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 7149 transitions. [2024-11-09 06:33:28,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:33:28,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:28,906 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, 1, 1] [2024-11-09 06:33:28,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-09 06:33:28,907 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:33:28,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:28,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1324706133, now seen corresponding path program 47 times [2024-11-09 06:33:28,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:28,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858246689] [2024-11-09 06:33:28,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:28,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:29,248 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 06:33:29,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:29,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858246689] [2024-11-09 06:33:29,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858246689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:29,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:29,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:33:29,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205768593] [2024-11-09 06:33:29,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:29,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:33:29,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:29,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:33:29,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:33:29,250 INFO L87 Difference]: Start difference. First operand 3614 states and 7149 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:30,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:30,568 INFO L93 Difference]: Finished difference Result 9583 states and 19113 transitions. [2024-11-09 06:33:30,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:33:30,569 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:33:30,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:30,632 INFO L225 Difference]: With dead ends: 9583 [2024-11-09 06:33:30,632 INFO L226 Difference]: Without dead ends: 6963 [2024-11-09 06:33:30,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:33:30,639 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 374 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:30,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1704 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:33:30,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6963 states. [2024-11-09 06:33:30,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6963 to 3612. [2024-11-09 06:33:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3612 states, 3599 states have (on average 1.9852736871353154) internal successors, (7145), 3611 states have internal predecessors, (7145), 0 states have call successors, (0), 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 06:33:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3612 states to 3612 states and 7145 transitions. [2024-11-09 06:33:30,860 INFO L78 Accepts]: Start accepts. Automaton has 3612 states and 7145 transitions. Word has length 171 [2024-11-09 06:33:30,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:30,860 INFO L471 AbstractCegarLoop]: Abstraction has 3612 states and 7145 transitions. [2024-11-09 06:33:30,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:30,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3612 states and 7145 transitions. [2024-11-09 06:33:30,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:33:30,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:30,863 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, 1, 1] [2024-11-09 06:33:30,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-09 06:33:30,863 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:33:30,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:30,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1550724065, now seen corresponding path program 48 times [2024-11-09 06:33:30,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:30,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457467220] [2024-11-09 06:33:30,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:30,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:31,223 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 06:33:31,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:31,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457467220] [2024-11-09 06:33:31,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457467220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:31,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:31,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:33:31,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75872473] [2024-11-09 06:33:31,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:31,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:33:31,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:31,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:33:31,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:33:31,226 INFO L87 Difference]: Start difference. First operand 3612 states and 7145 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:32,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:32,186 INFO L93 Difference]: Finished difference Result 9470 states and 18906 transitions. [2024-11-09 06:33:32,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:33:32,186 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:33:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:32,254 INFO L225 Difference]: With dead ends: 9470 [2024-11-09 06:33:32,254 INFO L226 Difference]: Without dead ends: 6850 [2024-11-09 06:33:32,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:33:32,261 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 437 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:32,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1538 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:33:32,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6850 states. [2024-11-09 06:33:32,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6850 to 3614. [2024-11-09 06:33:32,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3614 states, 3601 states have (on average 1.985281866148292) internal successors, (7149), 3613 states have internal predecessors, (7149), 0 states have call successors, (0), 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 06:33:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 7149 transitions. [2024-11-09 06:33:32,819 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 7149 transitions. Word has length 171 [2024-11-09 06:33:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:32,819 INFO L471 AbstractCegarLoop]: Abstraction has 3614 states and 7149 transitions. [2024-11-09 06:33:32,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:32,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 7149 transitions. [2024-11-09 06:33:32,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:33:32,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:32,823 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, 1, 1] [2024-11-09 06:33:32,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-09 06:33:32,823 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:33:32,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:32,824 INFO L85 PathProgramCache]: Analyzing trace with hash -411949719, now seen corresponding path program 49 times [2024-11-09 06:33:32,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:32,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072196053] [2024-11-09 06:33:32,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:32,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:33,398 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 06:33:33,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:33,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072196053] [2024-11-09 06:33:33,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072196053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:33,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:33,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:33:33,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288902745] [2024-11-09 06:33:33,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:33,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:33:33,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:33,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:33:33,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:33:33,402 INFO L87 Difference]: Start difference. First operand 3614 states and 7149 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:34,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:34,570 INFO L93 Difference]: Finished difference Result 8546 states and 17058 transitions. [2024-11-09 06:33:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:33:34,570 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 171 [2024-11-09 06:33:34,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:34,646 INFO L225 Difference]: With dead ends: 8546 [2024-11-09 06:33:34,646 INFO L226 Difference]: Without dead ends: 5926 [2024-11-09 06:33:34,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:33:34,654 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 303 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:34,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1413 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:33:34,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2024-11-09 06:33:34,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 3593. [2024-11-09 06:33:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3593 states, 3580 states have (on average 1.985195530726257) internal successors, (7107), 3592 states have internal predecessors, (7107), 0 states have call successors, (0), 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 06:33:35,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 7107 transitions. [2024-11-09 06:33:35,060 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 7107 transitions. Word has length 171 [2024-11-09 06:33:35,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:35,061 INFO L471 AbstractCegarLoop]: Abstraction has 3593 states and 7107 transitions. [2024-11-09 06:33:35,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 06:33:35,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 7107 transitions. [2024-11-09 06:33:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-09 06:33:35,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:35,063 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:33:35,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-11-09 06:33:35,063 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:33:35,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:35,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1527232445, now seen corresponding path program 1 times [2024-11-09 06:33:35,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:35,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531644879] [2024-11-09 06:33:35,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:35,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 06:33:35,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:35,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531644879] [2024-11-09 06:33:35,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531644879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:33:35,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613242476] [2024-11-09 06:33:35,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:35,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:33:35,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:33:35,174 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:33:35,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 06:33:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:35,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:33:35,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:33:35,555 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 06:33:35,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:33:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 06:33:35,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613242476] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:33:35,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1563885118] [2024-11-09 06:33:35,645 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 06:33:35,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:33:35,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 06:33:35,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221736504] [2024-11-09 06:33:35,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:33:35,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:33:35,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:35,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:33:35,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:33:35,649 INFO L87 Difference]: Start difference. First operand 3593 states and 7107 transitions. Second operand has 10 states, 10 states have (on average 18.8) internal successors, (188), 10 states have internal predecessors, (188), 0 states have call successors, (0), 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 06:33:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:36,081 INFO L93 Difference]: Finished difference Result 8067 states and 16232 transitions. [2024-11-09 06:33:36,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:33:36,082 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.8) internal successors, (188), 10 states have internal predecessors, (188), 0 states have call successors, (0), 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 178 [2024-11-09 06:33:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:36,148 INFO L225 Difference]: With dead ends: 8067 [2024-11-09 06:33:36,148 INFO L226 Difference]: Without dead ends: 7085 [2024-11-09 06:33:36,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 351 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 06:33:36,153 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 425 mSDsluCounter, 1661 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:36,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1908 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:33:36,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2024-11-09 06:33:36,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 6919. [2024-11-09 06:33:36,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6919 states, 6906 states have (on average 2.020417028670721) internal successors, (13953), 6918 states have internal predecessors, (13953), 0 states have call successors, (0), 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 06:33:36,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6919 states to 6919 states and 13953 transitions. [2024-11-09 06:33:36,484 INFO L78 Accepts]: Start accepts. Automaton has 6919 states and 13953 transitions. Word has length 178 [2024-11-09 06:33:36,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:36,485 INFO L471 AbstractCegarLoop]: Abstraction has 6919 states and 13953 transitions. [2024-11-09 06:33:36,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.8) internal successors, (188), 10 states have internal predecessors, (188), 0 states have call successors, (0), 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 06:33:36,485 INFO L276 IsEmpty]: Start isEmpty. Operand 6919 states and 13953 transitions. [2024-11-09 06:33:36,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 06:33:36,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:36,489 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:33:36,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 06:33:36,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2024-11-09 06:33:36,690 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:33:36,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:36,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1518100841, now seen corresponding path program 1 times [2024-11-09 06:33:36,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:36,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688183428] [2024-11-09 06:33:36,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:36,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:38,388 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 06:33:38,388 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:38,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688183428] [2024-11-09 06:33:38,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688183428] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:33:38,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559326254] [2024-11-09 06:33:38,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:38,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:33:38,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:33:38,390 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:33:38,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 06:33:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:38,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 06:33:38,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:33:39,680 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 06:33:39,736 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 21 treesize of output 20 [2024-11-09 06:33:39,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-09 06:33:39,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2024-11-09 06:33:40,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:40,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:40,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:40,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:40,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2024-11-09 06:33:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 06:33:40,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:33:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 06:33:42,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559326254] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:33:42,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [881671318] [2024-11-09 06:33:42,316 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 06:33:42,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:33:42,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 41 [2024-11-09 06:33:42,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236182535] [2024-11-09 06:33:42,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:33:42,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-09 06:33:42,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:42,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-09 06:33:42,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1518, Unknown=0, NotChecked=0, Total=1722 [2024-11-09 06:33:42,324 INFO L87 Difference]: Start difference. First operand 6919 states and 13953 transitions. Second operand has 42 states, 41 states have (on average 8.658536585365853) internal successors, (355), 42 states have internal predecessors, (355), 0 states have call successors, (0), 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 06:33:52,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:52,869 INFO L93 Difference]: Finished difference Result 17672 states and 35593 transitions. [2024-11-09 06:33:52,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-09 06:33:52,870 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 8.658536585365853) internal successors, (355), 42 states have internal predecessors, (355), 0 states have call successors, (0), 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 202 [2024-11-09 06:33:52,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:52,971 INFO L225 Difference]: With dead ends: 17672 [2024-11-09 06:33:52,971 INFO L226 Difference]: Without dead ends: 17562 [2024-11-09 06:33:52,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1459 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=837, Invalid=4713, Unknown=0, NotChecked=0, Total=5550 [2024-11-09 06:33:52,978 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 2412 mSDsluCounter, 3384 mSDsCounter, 0 mSdLazyCounter, 5731 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2412 SdHoareTripleChecker+Valid, 3690 SdHoareTripleChecker+Invalid, 5825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 5731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:52,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2412 Valid, 3690 Invalid, 5825 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [94 Valid, 5731 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-11-09 06:33:52,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17562 states. [2024-11-09 06:33:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17562 to 7850. [2024-11-09 06:33:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7850 states, 7837 states have (on average 2.0283271660074007) internal successors, (15896), 7849 states have internal predecessors, (15896), 0 states have call successors, (0), 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 06:33:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7850 states to 7850 states and 15896 transitions. [2024-11-09 06:33:53,590 INFO L78 Accepts]: Start accepts. Automaton has 7850 states and 15896 transitions. Word has length 202 [2024-11-09 06:33:53,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:53,590 INFO L471 AbstractCegarLoop]: Abstraction has 7850 states and 15896 transitions. [2024-11-09 06:33:53,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 8.658536585365853) internal successors, (355), 42 states have internal predecessors, (355), 0 states have call successors, (0), 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 06:33:53,591 INFO L276 IsEmpty]: Start isEmpty. Operand 7850 states and 15896 transitions. [2024-11-09 06:33:53,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 06:33:53,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:53,600 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:33:53,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 06:33:53,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2024-11-09 06:33:53,801 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:33:53,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:53,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1569394691, now seen corresponding path program 1 times [2024-11-09 06:33:53,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:53,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422433026] [2024-11-09 06:33:53,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:53,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 06:33:55,478 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:55,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422433026] [2024-11-09 06:33:55,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422433026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:33:55,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712563296] [2024-11-09 06:33:55,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:55,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:33:55,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:33:55,481 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:33:55,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 06:33:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:55,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 06:33:55,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:33:56,841 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 06:33:56,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:56,911 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 06:33:56,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:56,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:56,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 06:33:57,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:57,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:57,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:57,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2024-11-09 06:33:57,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:57,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:57,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:57,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:33:57,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2024-11-09 06:33:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 06:33:57,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:33:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 06:33:57,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712563296] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:33:57,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [829258260] [2024-11-09 06:33:57,969 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 06:33:57,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:33:57,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 37 [2024-11-09 06:33:57,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500858645] [2024-11-09 06:33:57,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:33:57,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 06:33:57,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:57,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 06:33:57,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1258, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 06:33:57,977 INFO L87 Difference]: Start difference. First operand 7850 states and 15896 transitions. Second operand has 38 states, 37 states have (on average 9.513513513513514) internal successors, (352), 38 states have internal predecessors, (352), 0 states have call successors, (0), 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 06:34:08,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:34:08,057 INFO L93 Difference]: Finished difference Result 17506 states and 35339 transitions. [2024-11-09 06:34:08,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-11-09 06:34:08,057 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 9.513513513513514) internal successors, (352), 38 states have internal predecessors, (352), 0 states have call successors, (0), 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 202 [2024-11-09 06:34:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:34:08,145 INFO L225 Difference]: With dead ends: 17506 [2024-11-09 06:34:08,146 INFO L226 Difference]: Without dead ends: 17467 [2024-11-09 06:34:08,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3659 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2107, Invalid=10549, Unknown=0, NotChecked=0, Total=12656 [2024-11-09 06:34:08,154 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 2465 mSDsluCounter, 3857 mSDsCounter, 0 mSdLazyCounter, 6389 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2465 SdHoareTripleChecker+Valid, 4229 SdHoareTripleChecker+Invalid, 6470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 6389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:34:08,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2465 Valid, 4229 Invalid, 6470 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [81 Valid, 6389 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-09 06:34:08,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17467 states. [2024-11-09 06:34:08,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17467 to 7789. [2024-11-09 06:34:08,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7789 states, 7776 states have (on average 2.027391975308642) internal successors, (15765), 7788 states have internal predecessors, (15765), 0 states have call successors, (0), 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 06:34:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7789 states to 7789 states and 15765 transitions. [2024-11-09 06:34:08,599 INFO L78 Accepts]: Start accepts. Automaton has 7789 states and 15765 transitions. Word has length 202 [2024-11-09 06:34:08,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:34:08,599 INFO L471 AbstractCegarLoop]: Abstraction has 7789 states and 15765 transitions. [2024-11-09 06:34:08,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 9.513513513513514) internal successors, (352), 38 states have internal predecessors, (352), 0 states have call successors, (0), 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 06:34:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 7789 states and 15765 transitions. [2024-11-09 06:34:08,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 06:34:08,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:34:08,604 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:34:08,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 06:34:08,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2024-11-09 06:34:08,805 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:34:08,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:34:08,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1691518075, now seen corresponding path program 1 times [2024-11-09 06:34:08,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:34:08,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719144725] [2024-11-09 06:34:08,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:34:08,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:34:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:34:11,245 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 06:34:11,245 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:34:11,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719144725] [2024-11-09 06:34:11,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719144725] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:34:11,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436543051] [2024-11-09 06:34:11,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:34:11,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:34:11,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:34:11,247 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:34:11,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 06:34:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:34:11,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-09 06:34:11,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:34:12,794 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 06:34:12,862 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 06:34:12,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-09 06:34:13,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-09 06:34:13,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2024-11-09 06:34:13,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51 [2024-11-09 06:34:13,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2024-11-09 06:34:13,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2024-11-09 06:34:14,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2024-11-09 06:34:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 06:34:14,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:34:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 06:34:19,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436543051] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:34:19,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1936606832] [2024-11-09 06:34:19,828 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 06:34:19,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:34:19,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 17] total 46 [2024-11-09 06:34:19,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390291845] [2024-11-09 06:34:19,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:34:19,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-09 06:34:19,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:34:19,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-09 06:34:19,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1871, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 06:34:19,833 INFO L87 Difference]: Start difference. First operand 7789 states and 15765 transitions. Second operand has 47 states, 46 states have (on average 7.717391304347826) internal successors, (355), 47 states have internal predecessors, (355), 0 states have call successors, (0), 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 06:35:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:35:01,527 INFO L93 Difference]: Finished difference Result 18555 states and 37428 transitions. [2024-11-09 06:35:01,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-09 06:35:01,527 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 7.717391304347826) internal successors, (355), 47 states have internal predecessors, (355), 0 states have call successors, (0), 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 202 [2024-11-09 06:35:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:35:01,613 INFO L225 Difference]: With dead ends: 18555 [2024-11-09 06:35:01,613 INFO L226 Difference]: Without dead ends: 18221 [2024-11-09 06:35:01,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 376 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2464 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=1245, Invalid=6411, Unknown=0, NotChecked=0, Total=7656 [2024-11-09 06:35:01,625 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 1601 mSDsluCounter, 3075 mSDsCounter, 0 mSdLazyCounter, 4244 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1601 SdHoareTripleChecker+Valid, 3358 SdHoareTripleChecker+Invalid, 4329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 4244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:35:01,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1601 Valid, 3358 Invalid, 4329 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [85 Valid, 4244 Invalid, 0 Unknown, 0 Unchecked, 32.5s Time] [2024-11-09 06:35:01,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18221 states. [2024-11-09 06:35:02,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18221 to 7907. [2024-11-09 06:35:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7907 states, 7894 states have (on average 2.027235875348366) internal successors, (16003), 7906 states have internal predecessors, (16003), 0 states have call successors, (0), 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 06:35:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7907 states to 7907 states and 16003 transitions. [2024-11-09 06:35:02,188 INFO L78 Accepts]: Start accepts. Automaton has 7907 states and 16003 transitions. Word has length 202 [2024-11-09 06:35:02,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:35:02,189 INFO L471 AbstractCegarLoop]: Abstraction has 7907 states and 16003 transitions. [2024-11-09 06:35:02,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 7.717391304347826) internal successors, (355), 47 states have internal predecessors, (355), 0 states have call successors, (0), 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 06:35:02,189 INFO L276 IsEmpty]: Start isEmpty. Operand 7907 states and 16003 transitions. [2024-11-09 06:35:02,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 06:35:02,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:35:02,193 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:35:02,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 06:35:02,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2024-11-09 06:35:02,394 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:35:02,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:35:02,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1885582665, now seen corresponding path program 2 times [2024-11-09 06:35:02,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:35:02,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289490165] [2024-11-09 06:35:02,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:35:02,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:35:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:35:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 06:35:04,341 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:35:04,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289490165] [2024-11-09 06:35:04,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289490165] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:35:04,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983877579] [2024-11-09 06:35:04,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:35:04,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:35:04,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:35:04,342 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:35:04,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 06:35:04,617 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 06:35:04,617 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:35:04,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-09 06:35:04,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:35:05,539 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 06:35:05,602 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 06:35:05,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-09 06:35:05,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-09 06:35:06,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2024-11-09 06:35:06,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2024-11-09 06:35:06,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 60 [2024-11-09 06:35:06,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 72 [2024-11-09 06:35:06,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:35:06,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 80 [2024-11-09 06:35:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 06:35:19,012 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:35:51,801 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0)))) (let ((.cse0 (+ (* |c_t_funThread1of1ForFork0_#t~post35#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (select .cse1 |c_~#cache~0.base|))) (and (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 1) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 2) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 3) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 1) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 2) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 3) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 1) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 2) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 3) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3) 0))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 1) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 2) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 3) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))))))) is different from false [2024-11-09 06:35:53,977 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0)))) (let ((.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (select .cse1 |c_~#cache~0.base|))) (and (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 1) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 2) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 3) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 1) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 2) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 3) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 1) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 2) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 3) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 1) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 2) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 3) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3) 0))))))) is different from false [2024-11-09 06:36:51,248 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0) .cse5 0) .cse4 0)))) (let ((.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse1 (select .cse0 |c_~#cache~0.base|))) (and (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 1) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 2) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 3) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse3))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse3) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 1) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 2) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 3) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse3) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 1) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 2) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 3) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4) 0))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse3) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 1) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 2) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 3) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5) 0))))))) is different from false [2024-11-09 06:36:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 06:36:52,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983877579] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:36:52,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1077238790] [2024-11-09 06:36:52,505 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 06:36:52,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:36:52,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 18] total 49 [2024-11-09 06:36:52,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386746336] [2024-11-09 06:36:52,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:36:52,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 06:36:52,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:36:52,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 06:36:52,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1862, Unknown=32, NotChecked=276, Total=2450 [2024-11-09 06:36:52,509 INFO L87 Difference]: Start difference. First operand 7907 states and 16003 transitions. Second operand has 50 states, 49 states have (on average 7.244897959183674) internal successors, (355), 50 states have internal predecessors, (355), 0 states have call successors, (0), 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 06:37:28,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:37:30,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:37:35,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:37:37,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:37:43,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:37:47,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:37:49,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:37:51,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:37:54,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:37:56,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:38:00,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:38:09,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:38:11,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:38:13,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:38:15,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:38:21,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:38:26,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:38:28,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:38:34,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:38:36,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:38:40,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:38:43,405 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse10 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse10 .cse3 0))) (.cse4 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store .cse10 .cse7 0) .cse3 0)))) (let ((.cse8 (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse9 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse0 (+ .cse4 28 |c_~#cache~0.offset|)) (.cse6 (select .cse5 |c_~#cache~0.base|))) (and (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 1) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 2) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 3) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3) 0))) (or (< |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| (+ .cse4 25 |c_~#cache~0.offset|)) (not (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0) (= (select (select (store .cse5 |c_~#cache~0.base| (store (store (store (store .cse6 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 1) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 2) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 3) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0) (= 0 (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 1) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 2) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 3) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)))) (< |c_ULTIMATE.start_main_~i~2#1| .cse8) (< 0 .cse8) (= |c_~#cache~0.base| 1) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 1) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 2) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 3) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0) (= (select (select (store .cse5 |c_~#cache~0.base| (store (store (store (store .cse6 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 1) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 2) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 3) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse9) 0))) (= |c_~#cache~0.offset| 0) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 1) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 2) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 3) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse9) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (= (select (select (store .cse5 |c_~#cache~0.base| (store (store (store (store .cse6 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 1) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 2) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 3) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0) (= (select (select (store .cse5 |c_~#cache~0.base| (store (store (store (store .cse6 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 1) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 2) 0) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 3) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3) 0))))))) is different from true [2024-11-09 06:38:46,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:38:48,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:38:50,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:38:52,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:38:55,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:38:57,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:38:59,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:01,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:03,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:05,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:08,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:10,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:14,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:18,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:21,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:23,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:25,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:26,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:39:28,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:30,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:35,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:37,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:39,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:41,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:43,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:45,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:48,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:50,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:52,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:57,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:39:59,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:40:05,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:40:09,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:40:11,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:40:13,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:40:16,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:40:18,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:40:20,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:40:23,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:40:25,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:40:27,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:40:39,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:40:43,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:40:47,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:40:50,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:40:53,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:40:56,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:40:57,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:41:00,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:02,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:04,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:09,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:15,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:17,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:19,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:21,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:23,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:25,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:27,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:29,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:31,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:33,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:35,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:37,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:39,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:41,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:43,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:46,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:52,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:54,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:56,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:41:58,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:42:00,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:42:04,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:42:06,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:42:08,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:42:10,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:42:12,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:42:14,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:42:18,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:42:20,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:42:24,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:42:28,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:42:30,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:42:32,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:42:34,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:42:37,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:42:39,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:42:58,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:43:01,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:43:03,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:43:07,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:43:10,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:43:12,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:43:16,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:43:18,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:43:26,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:43:26,638 INFO L93 Difference]: Finished difference Result 18752 states and 37857 transitions. [2024-11-09 06:43:26,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-09 06:43:26,638 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 7.244897959183674) internal successors, (355), 50 states have internal predecessors, (355), 0 states have call successors, (0), 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 202 [2024-11-09 06:43:26,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:43:26,744 INFO L225 Difference]: With dead ends: 18752 [2024-11-09 06:43:26,744 INFO L226 Difference]: Without dead ends: 18718 [2024-11-09 06:43:26,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2672 ImplicationChecksByTransitivity, 188.3s TimeCoverageRelationStatistics Valid=1527, Invalid=7164, Unknown=67, NotChecked=748, Total=9506 [2024-11-09 06:43:26,754 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 1918 mSDsluCounter, 4298 mSDsCounter, 0 mSdLazyCounter, 7002 mSolverCounterSat, 144 mSolverCounterUnsat, 113 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 307.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1918 SdHoareTripleChecker+Valid, 4585 SdHoareTripleChecker+Invalid, 11011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 7002 IncrementalHoareTripleChecker+Invalid, 113 IncrementalHoareTripleChecker+Unknown, 3752 IncrementalHoareTripleChecker+Unchecked, 309.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:43:26,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1918 Valid, 4585 Invalid, 11011 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [144 Valid, 7002 Invalid, 113 Unknown, 3752 Unchecked, 309.9s Time] [2024-11-09 06:43:26,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18718 states. [2024-11-09 06:43:27,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18718 to 7893. [2024-11-09 06:43:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7893 states, 7880 states have (on average 2.02753807106599) internal successors, (15977), 7892 states have internal predecessors, (15977), 0 states have call successors, (0), 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 06:43:27,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 15977 transitions. [2024-11-09 06:43:27,299 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 15977 transitions. Word has length 202 [2024-11-09 06:43:27,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:43:27,299 INFO L471 AbstractCegarLoop]: Abstraction has 7893 states and 15977 transitions. [2024-11-09 06:43:27,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 7.244897959183674) internal successors, (355), 50 states have internal predecessors, (355), 0 states have call successors, (0), 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 06:43:27,300 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 15977 transitions. [2024-11-09 06:43:27,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 06:43:27,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:43:27,305 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:27,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 06:43:27,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:43:27,506 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:43:27,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:43:27,507 INFO L85 PathProgramCache]: Analyzing trace with hash 499177771, now seen corresponding path program 3 times [2024-11-09 06:43:27,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:43:27,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880847765] [2024-11-09 06:43:27,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:43:27,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:43:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:43:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 06:43:30,296 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:43:30,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880847765] [2024-11-09 06:43:30,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880847765] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:43:30,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478110574] [2024-11-09 06:43:30,297 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 06:43:30,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:43:30,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:43:30,300 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:43:30,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b194b13-4a3b-41a0-9f31-c945d87e3c58/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 06:43:30,982 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 06:43:30,982 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:43:30,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 06:43:30,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:43:31,842 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 06:43:31,927 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 06:43:32,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-09 06:43:32,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-09 06:43:32,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:32,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:32,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:32,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:32,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2024-11-09 06:43:33,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2024-11-09 06:43:33,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 60 [2024-11-09 06:43:33,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2024-11-09 06:43:33,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:43:33,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:43:33,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 60 treesize of output 56 [2024-11-09 06:43:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 06:43:37,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:43:48,934 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0)))) (let ((.cse0 (+ (* |c_t_funThread1of1ForFork0_#t~post35#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (select .cse1 |c_~#cache~0.base|))) (and (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_3340 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse0) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| 3) v_ArrVal_3340) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_3340 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse0) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| 3) v_ArrVal_3340) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3) 0))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_3340 Int)) (or (= (select (select (store .cse1 |c_~#cache~0.base| (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| 3) v_ArrVal_3340) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse0))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_3340 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse0) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| 3) v_ArrVal_3340) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0))))))) is different from false [2024-11-09 06:43:51,048 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_3340 Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| 3) v_ArrVal_3340) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse3))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_3340 Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| 3) v_ArrVal_3340) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse3))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_3340 Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| 3) v_ArrVal_3340) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse3))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_3340 Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| 3) v_ArrVal_3340) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse3))))))) is different from false [2024-11-09 06:43:53,186 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 0) .cse3 0)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_3340 Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| 3) v_ArrVal_3340) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse2))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_3340 Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| 3) v_ArrVal_3340) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse2))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_3340 Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| 3) v_ArrVal_3340) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse2))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_3340 Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| 3) v_ArrVal_3340) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse2))))))) is different from false [2024-11-09 06:44:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 06:44:38,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478110574] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:44:38,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2122634778] [2024-11-09 06:44:38,489 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 06:44:38,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:44:38,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 15] total 44 [2024-11-09 06:44:38,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703463148] [2024-11-09 06:44:38,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:44:38,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-09 06:44:38,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:44:38,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-09 06:44:38,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1482, Unknown=25, NotChecked=246, Total=1980 [2024-11-09 06:44:38,498 INFO L87 Difference]: Start difference. First operand 7893 states and 15977 transitions. Second operand has 45 states, 44 states have (on average 8.068181818181818) internal successors, (355), 45 states have internal predecessors, (355), 0 states have call successors, (0), 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 06:44:52,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:44:54,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:44:56,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:44:58,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:45:03,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:45:05,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:45:07,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:45:09,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:45:11,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:45:13,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:45:16,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:45:21,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:45:23,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:45:25,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:45:27,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:45:32,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:45:36,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:45:39,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:45:43,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]