./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.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_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/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_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/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_e5942150-6540-498d-8905-9a9d1d0acf8e/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 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:31:56,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:31:56,225 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DataRace-32bit-Taipan_Default.epf [2024-11-09 04:31:56,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:31:56,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:31:56,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:31:56,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:31:56,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:31:56,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:31:56,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:31:56,302 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:31:56,302 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:31:56,303 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:31:56,304 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:31:56,306 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:31:56,306 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:31:56,307 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:31:56,307 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:31:56,308 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:31:56,308 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:31:56,309 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:31:56,314 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:31:56,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:31:56,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:31:56,315 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:31:56,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:31:56,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:31:56,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:31:56,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:31:56,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:31:56,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:31:56,322 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 04:31:56,322 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:31:56,323 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 04:31:56,323 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:31:56,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:31:56,324 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:31:56,324 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:31:56,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:31:56,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:31:56,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:31:56,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:31:56,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:31:56,331 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:31:56,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:31:56,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:31:56,333 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:31:56,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:31:56,334 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_e5942150-6540-498d-8905-9a9d1d0acf8e/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_e5942150-6540-498d-8905-9a9d1d0acf8e/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 -> 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a [2024-11-09 04:31:56,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:31:56,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:31:56,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:31:56,739 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:31:56,740 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:31:56,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i Unable to find full path for "g++" [2024-11-09 04:31:59,299 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:31:59,617 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:31:59,618 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i [2024-11-09 04:31:59,648 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/data/b768b046d/c816c03230a14581919594470f6bc600/FLAGc77c3bd08 [2024-11-09 04:31:59,675 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/data/b768b046d/c816c03230a14581919594470f6bc600 [2024-11-09 04:31:59,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:31:59,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:31:59,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:31:59,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:31:59,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:31:59,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:31:59" (1/1) ... [2024-11-09 04:31:59,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@88b4b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:31:59, skipping insertion in model container [2024-11-09 04:31:59,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:31:59" (1/1) ... [2024-11-09 04:31:59,784 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:32:00,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:32:00,590 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:32:00,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:32:00,783 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:32:00,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:00 WrapperNode [2024-11-09 04:32:00,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:32:00,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:32:00,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:32:00,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:32:00,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:00" (1/1) ... [2024-11-09 04:32:00,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:00" (1/1) ... [2024-11-09 04:32:00,886 INFO L138 Inliner]: procedures = 263, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 176 [2024-11-09 04:32:00,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:32:00,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:32:00,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:32:00,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:32:00,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:00" (1/1) ... [2024-11-09 04:32:00,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:00" (1/1) ... [2024-11-09 04:32:00,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:00" (1/1) ... [2024-11-09 04:32:00,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:00" (1/1) ... [2024-11-09 04:32:00,944 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:00" (1/1) ... [2024-11-09 04:32:00,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:00" (1/1) ... [2024-11-09 04:32:00,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:00" (1/1) ... [2024-11-09 04:32:00,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:00" (1/1) ... [2024-11-09 04:32:00,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:32:00,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:32:00,965 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:32:00,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:32:00,966 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:00" (1/1) ... [2024-11-09 04:32:00,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:32:01,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:32:01,030 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:32:01,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:32:01,072 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 04:32:01,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 04:32:01,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 04:32:01,073 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 04:32:01,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:32:01,074 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 04:32:01,074 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 04:32:01,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:32:01,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:32:01,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:32:01,077 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 04:32:01,290 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:32:01,293 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:32:01,823 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 04:32:01,823 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:32:01,912 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:32:01,915 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 04:32:01,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:32:01 BoogieIcfgContainer [2024-11-09 04:32:01,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:32:01,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:32:01,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:32:01,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:32:01,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:31:59" (1/3) ... [2024-11-09 04:32:01,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5323e326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:32:01, skipping insertion in model container [2024-11-09 04:32:01,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:00" (2/3) ... [2024-11-09 04:32:01,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5323e326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:32:01, skipping insertion in model container [2024-11-09 04:32:01,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:32:01" (3/3) ... [2024-11-09 04:32:01,971 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.i [2024-11-09 04:32:01,999 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:32:01,999 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-09 04:32:01,999 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 04:32:02,078 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 04:32:02,120 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 186 places, 188 transitions, 380 flow [2024-11-09 04:32:02,311 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 04:32:02,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:32:02,348 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;@69df2c44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:32:02,349 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-09 04:32:02,358 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 04:32:02,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-09 04:32:02,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:02,373 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 04:32:02,374 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 04:32:02,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:02,380 INFO L85 PathProgramCache]: Analyzing trace with hash 533362969, now seen corresponding path program 1 times [2024-11-09 04:32:02,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:02,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769236541] [2024-11-09 04:32:02,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:02,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:02,898 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 04:32:02,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:02,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769236541] [2024-11-09 04:32:02,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769236541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:02,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:02,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:32:02,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833513083] [2024-11-09 04:32:02,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:02,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:32:02,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:02,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:32:02,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:32:02,965 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 04:32:03,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:03,203 INFO L93 Difference]: Finished difference Result 5024 states and 10146 transitions. [2024-11-09 04:32:03,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:32:03,207 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 04:32:03,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:03,249 INFO L225 Difference]: With dead ends: 5024 [2024-11-09 04:32:03,250 INFO L226 Difference]: Without dead ends: 2551 [2024-11-09 04:32:03,260 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 04:32:03,263 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 4 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 04:32:03,265 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 04:32:03,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2024-11-09 04:32:03,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 2548. [2024-11-09 04:32:03,439 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 04:32:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 5109 transitions. [2024-11-09 04:32:03,462 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 5109 transitions. Word has length 87 [2024-11-09 04:32:03,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:03,463 INFO L471 AbstractCegarLoop]: Abstraction has 2548 states and 5109 transitions. [2024-11-09 04:32:03,464 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 04:32:03,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 5109 transitions. [2024-11-09 04:32:03,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 04:32:03,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:03,471 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 04:32:03,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:32:03,473 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 04:32:03,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:03,475 INFO L85 PathProgramCache]: Analyzing trace with hash 994570069, now seen corresponding path program 1 times [2024-11-09 04:32:03,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:03,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411376477] [2024-11-09 04:32:03,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:03,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:03,837 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 04:32:03,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:03,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411376477] [2024-11-09 04:32:03,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411376477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:32:03,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606007831] [2024-11-09 04:32:03,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:03,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:32:03,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:32:03,843 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:32:03,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:32:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:03,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 04:32:04,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:04,060 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 04:32:04,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:32:04,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606007831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:04,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:32:04,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 04:32:04,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747825447] [2024-11-09 04:32:04,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:04,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:32:04,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:04,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:32:04,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:32:04,073 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 04:32:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:04,275 INFO L93 Difference]: Finished difference Result 4858 states and 9818 transitions. [2024-11-09 04:32:04,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:32:04,276 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 04:32:04,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:04,302 INFO L225 Difference]: With dead ends: 4858 [2024-11-09 04:32:04,303 INFO L226 Difference]: Without dead ends: 3796 [2024-11-09 04:32:04,307 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 04:32:04,308 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 04:32:04,309 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 04:32:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3796 states. [2024-11-09 04:32:04,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3796 to 2626. [2024-11-09 04:32:04,413 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 04:32:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 5267 transitions. [2024-11-09 04:32:04,434 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 5267 transitions. Word has length 93 [2024-11-09 04:32:04,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:04,436 INFO L471 AbstractCegarLoop]: Abstraction has 2626 states and 5267 transitions. [2024-11-09 04:32:04,437 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 04:32:04,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 5267 transitions. [2024-11-09 04:32:04,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 04:32:04,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:04,447 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 04:32:04,475 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 04:32:04,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:32:04,649 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 04:32:04,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:04,651 INFO L85 PathProgramCache]: Analyzing trace with hash -263909244, now seen corresponding path program 1 times [2024-11-09 04:32:04,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:04,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126675290] [2024-11-09 04:32:04,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:04,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:04,934 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 04:32:04,935 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:04,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126675290] [2024-11-09 04:32:04,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126675290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:32:04,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742123891] [2024-11-09 04:32:04,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:04,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:32:04,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:32:04,940 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:32:04,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 04:32:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:05,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 04:32:05,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:05,239 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 04:32:05,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:32:05,327 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 04:32:05,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742123891] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:32:05,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1034412629] [2024-11-09 04:32:05,346 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 04:32:05,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:32:05,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 04:32:05,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829215148] [2024-11-09 04:32:05,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:32:05,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 04:32:05,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:05,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 04:32:05,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:32:05,359 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 04:32:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:05,575 INFO L93 Difference]: Finished difference Result 5188 states and 10471 transitions. [2024-11-09 04:32:05,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:05,576 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 04:32:05,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:05,601 INFO L225 Difference]: With dead ends: 5188 [2024-11-09 04:32:05,601 INFO L226 Difference]: Without dead ends: 2637 [2024-11-09 04:32:05,608 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 04:32:05,609 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 04:32:05,610 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 04:32:05,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2024-11-09 04:32:05,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 2637. [2024-11-09 04:32:05,719 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 04:32:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 5277 transitions. [2024-11-09 04:32:05,743 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 5277 transitions. Word has length 97 [2024-11-09 04:32:05,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:05,745 INFO L471 AbstractCegarLoop]: Abstraction has 2637 states and 5277 transitions. [2024-11-09 04:32:05,745 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 04:32:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 5277 transitions. [2024-11-09 04:32:05,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 04:32:05,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:05,749 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 04:32:05,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 04:32:05,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:32:05,950 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 04:32:05,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:05,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1725797892, now seen corresponding path program 2 times [2024-11-09 04:32:05,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:05,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345359066] [2024-11-09 04:32:05,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:05,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:06,336 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 04:32:06,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:06,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345359066] [2024-11-09 04:32:06,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345359066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:32:06,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460134628] [2024-11-09 04:32:06,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:32:06,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:32:06,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:32:06,340 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:32:06,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 04:32:06,487 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 04:32:06,487 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:32:06,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 04:32:06,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:06,553 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 04:32:06,583 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 04:32:06,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:32:06,635 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 04:32:06,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:32:06,698 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 04:32:06,752 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 04:32:06,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:32:06,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460134628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:06,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:32:06,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-11-09 04:32:06,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764878537] [2024-11-09 04:32:06,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:06,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:32:06,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:06,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:32:06,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-09 04:32:06,755 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 04:32:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:07,374 INFO L93 Difference]: Finished difference Result 3186 states and 6384 transitions. [2024-11-09 04:32:07,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:32:07,375 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 04:32:07,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:07,399 INFO L225 Difference]: With dead ends: 3186 [2024-11-09 04:32:07,400 INFO L226 Difference]: Without dead ends: 3120 [2024-11-09 04:32:07,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-09 04:32:07,403 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:07,404 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.5s Time] [2024-11-09 04:32:07,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2024-11-09 04:32:07,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2876. [2024-11-09 04:32:07,498 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 04:32:07,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 5759 transitions. [2024-11-09 04:32:07,522 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 5759 transitions. Word has length 109 [2024-11-09 04:32:07,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:07,523 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 5759 transitions. [2024-11-09 04:32:07,523 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 04:32:07,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 5759 transitions. [2024-11-09 04:32:07,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 04:32:07,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:07,526 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 04:32:07,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 04:32:07,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:32:07,727 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 04:32:07,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:07,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1731774378, now seen corresponding path program 1 times [2024-11-09 04:32:07,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:07,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474585074] [2024-11-09 04:32:07,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:07,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:08,073 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 04:32:08,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:08,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474585074] [2024-11-09 04:32:08,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474585074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:32:08,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809257961] [2024-11-09 04:32:08,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:08,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:32:08,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:32:08,080 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:32:08,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 04:32:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:08,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 04:32:08,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:08,320 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 04:32:08,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:32:08,502 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 04:32:08,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809257961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:32:08,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [407064735] [2024-11-09 04:32:08,508 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 04:32:08,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:32:08,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-09 04:32:08,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855537874] [2024-11-09 04:32:08,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:32:08,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 04:32:08,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:08,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 04:32:08,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-09 04:32:08,514 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 04:32:08,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:08,970 INFO L93 Difference]: Finished difference Result 5690 states and 11459 transitions. [2024-11-09 04:32:08,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 04:32:08,970 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 04:32:08,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:08,994 INFO L225 Difference]: With dead ends: 5690 [2024-11-09 04:32:08,994 INFO L226 Difference]: Without dead ends: 2900 [2024-11-09 04:32:09,002 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 04:32:09,003 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 04:32:09,003 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 04:32:09,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2024-11-09 04:32:09,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 2900. [2024-11-09 04:32:09,089 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 04:32:09,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 5783 transitions. [2024-11-09 04:32:09,109 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 5783 transitions. Word has length 109 [2024-11-09 04:32:09,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:09,110 INFO L471 AbstractCegarLoop]: Abstraction has 2900 states and 5783 transitions. [2024-11-09 04:32:09,110 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 04:32:09,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 5783 transitions. [2024-11-09 04:32:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 04:32:09,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:09,113 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 04:32:09,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 04:32:09,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:32:09,314 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 04:32:09,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:09,315 INFO L85 PathProgramCache]: Analyzing trace with hash -360046950, now seen corresponding path program 2 times [2024-11-09 04:32:09,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:09,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977138199] [2024-11-09 04:32:09,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:09,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:09,970 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 04:32:09,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:09,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977138199] [2024-11-09 04:32:09,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977138199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:32:09,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333238007] [2024-11-09 04:32:09,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:32:09,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:32:09,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:32:09,973 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:32:09,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 04:32:10,116 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 04:32:10,116 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:32:10,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 04:32:10,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:10,137 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 04:32:10,171 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 04:32:10,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:32:10,216 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 04:32:10,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:32:10,282 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 04:32:10,342 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 04:32:10,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:32:10,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333238007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:10,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:32:10,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2024-11-09 04:32:10,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318747296] [2024-11-09 04:32:10,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:10,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:32:10,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:10,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:32:10,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-09 04:32:10,346 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 04:32:10,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:10,856 INFO L93 Difference]: Finished difference Result 3215 states and 6422 transitions. [2024-11-09 04:32:10,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:32:10,857 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 04:32:10,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:10,882 INFO L225 Difference]: With dead ends: 3215 [2024-11-09 04:32:10,883 INFO L226 Difference]: Without dead ends: 3172 [2024-11-09 04:32:10,885 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 04:32:10,886 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 04:32:10,886 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 04:32:10,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3172 states. [2024-11-09 04:32:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3172 to 3032. [2024-11-09 04:32:10,988 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 04:32:10,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3032 states to 3032 states and 6051 transitions. [2024-11-09 04:32:11,005 INFO L78 Accepts]: Start accepts. Automaton has 3032 states and 6051 transitions. Word has length 133 [2024-11-09 04:32:11,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:11,006 INFO L471 AbstractCegarLoop]: Abstraction has 3032 states and 6051 transitions. [2024-11-09 04:32:11,007 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 04:32:11,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3032 states and 6051 transitions. [2024-11-09 04:32:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 04:32:11,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:11,010 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 04:32:11,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 04:32:11,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 04:32:11,214 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 04:32:11,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:11,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1662211215, now seen corresponding path program 1 times [2024-11-09 04:32:11,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:11,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819320075] [2024-11-09 04:32:11,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:11,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:11,897 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 04:32:11,897 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:11,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819320075] [2024-11-09 04:32:11,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819320075] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:32:11,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217239354] [2024-11-09 04:32:11,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:11,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:32:11,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:32:11,905 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:32:11,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 04:32:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:12,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 04:32:12,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:32:12,237 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 04:32:12,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:32:12,593 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 04:32:12,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217239354] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:32:12,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [948451260] [2024-11-09 04:32:12,596 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 04:32:12,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:32:12,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2024-11-09 04:32:12,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859747591] [2024-11-09 04:32:12,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:32:12,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 04:32:12,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:12,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 04:32:12,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-11-09 04:32:12,601 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 04:32:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:13,166 INFO L93 Difference]: Finished difference Result 5972 states and 12012 transitions. [2024-11-09 04:32:13,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-09 04:32:13,167 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 04:32:13,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:13,200 INFO L225 Difference]: With dead ends: 5972 [2024-11-09 04:32:13,202 INFO L226 Difference]: Without dead ends: 3050 [2024-11-09 04:32:13,209 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 04:32:13,210 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:13,211 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.1s Time] [2024-11-09 04:32:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3050 states. [2024-11-09 04:32:13,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3050 to 3050. [2024-11-09 04:32:13,288 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 04:32:13,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 6069 transitions. [2024-11-09 04:32:13,306 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 6069 transitions. Word has length 141 [2024-11-09 04:32:13,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:13,306 INFO L471 AbstractCegarLoop]: Abstraction has 3050 states and 6069 transitions. [2024-11-09 04:32:13,307 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 04:32:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 6069 transitions. [2024-11-09 04:32:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 04:32:13,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:13,310 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 04:32:13,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 04:32:13,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:32:13,511 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 04:32:13,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:13,511 INFO L85 PathProgramCache]: Analyzing trace with hash 98871333, now seen corresponding path program 2 times [2024-11-09 04:32:13,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:13,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741882471] [2024-11-09 04:32:13,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:13,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:14,448 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 04:32:14,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:14,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741882471] [2024-11-09 04:32:14,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741882471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:14,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:14,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:32:14,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299884996] [2024-11-09 04:32:14,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:14,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:32:14,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:14,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:32:14,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:32:14,452 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 04:32:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:15,023 INFO L93 Difference]: Finished difference Result 3550 states and 7073 transitions. [2024-11-09 04:32:15,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:32:15,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 04:32:15,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:15,045 INFO L225 Difference]: With dead ends: 3550 [2024-11-09 04:32:15,045 INFO L226 Difference]: Without dead ends: 3110 [2024-11-09 04:32:15,048 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 04:32:15,049 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 04:32:15,049 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 04:32:15,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2024-11-09 04:32:15,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 2948. [2024-11-09 04:32:15,134 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 04:32:15,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 5849 transitions. [2024-11-09 04:32:15,154 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 5849 transitions. Word has length 159 [2024-11-09 04:32:15,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:15,154 INFO L471 AbstractCegarLoop]: Abstraction has 2948 states and 5849 transitions. [2024-11-09 04:32:15,155 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 04:32:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 5849 transitions. [2024-11-09 04:32:15,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 04:32:15,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:15,158 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 04:32:15,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 04:32:15,159 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 04:32:15,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:15,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1171863775, now seen corresponding path program 1 times [2024-11-09 04:32:15,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:15,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810356301] [2024-11-09 04:32:15,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:15,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:15,976 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 04:32:15,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:15,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810356301] [2024-11-09 04:32:15,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810356301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:15,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:15,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:32:15,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701422020] [2024-11-09 04:32:15,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:15,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:32:15,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:15,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:32:15,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:32:15,980 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 04:32:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:16,295 INFO L93 Difference]: Finished difference Result 3260 states and 6473 transitions. [2024-11-09 04:32:16,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:32:16,296 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 04:32:16,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:16,344 INFO L225 Difference]: With dead ends: 3260 [2024-11-09 04:32:16,344 INFO L226 Difference]: Without dead ends: 3213 [2024-11-09 04:32:16,345 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 04:32:16,348 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 134 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 04:32:16,348 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 04:32:16,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3213 states. [2024-11-09 04:32:16,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3213 to 3087. [2024-11-09 04:32:16,441 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 04:32:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 3087 states and 6131 transitions. [2024-11-09 04:32:16,461 INFO L78 Accepts]: Start accepts. Automaton has 3087 states and 6131 transitions. Word has length 159 [2024-11-09 04:32:16,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:16,462 INFO L471 AbstractCegarLoop]: Abstraction has 3087 states and 6131 transitions. [2024-11-09 04:32:16,462 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 04:32:16,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3087 states and 6131 transitions. [2024-11-09 04:32:16,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:16,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:16,467 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 04:32:16,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 04:32:16,467 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 04:32:16,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:16,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2109276301, now seen corresponding path program 1 times [2024-11-09 04:32:16,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:16,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488444687] [2024-11-09 04:32:16,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:16,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:17,374 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 04:32:17,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:17,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488444687] [2024-11-09 04:32:17,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488444687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:17,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:17,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:17,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239867792] [2024-11-09 04:32:17,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:17,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:17,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:17,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:17,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:17,381 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 04:32:18,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:18,859 INFO L93 Difference]: Finished difference Result 9630 states and 19412 transitions. [2024-11-09 04:32:18,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:18,860 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 04:32:18,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:18,900 INFO L225 Difference]: With dead ends: 9630 [2024-11-09 04:32:18,900 INFO L226 Difference]: Without dead ends: 6995 [2024-11-09 04:32:18,909 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 04:32:18,910 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:18,912 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.1s Time] [2024-11-09 04:32:18,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6995 states. [2024-11-09 04:32:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6995 to 3378. [2024-11-09 04:32:19,144 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 04:32:19,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3378 states to 3378 states and 6696 transitions. [2024-11-09 04:32:19,174 INFO L78 Accepts]: Start accepts. Automaton has 3378 states and 6696 transitions. Word has length 171 [2024-11-09 04:32:19,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:19,175 INFO L471 AbstractCegarLoop]: Abstraction has 3378 states and 6696 transitions. [2024-11-09 04:32:19,175 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 04:32:19,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3378 states and 6696 transitions. [2024-11-09 04:32:19,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:19,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:19,180 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 04:32:19,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 04:32:19,180 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 04:32:19,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:19,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1147320485, now seen corresponding path program 1 times [2024-11-09 04:32:19,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:19,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142568400] [2024-11-09 04:32:19,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:19,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:20,153 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 04:32:20,153 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:20,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142568400] [2024-11-09 04:32:20,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142568400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:20,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:20,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:20,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768510467] [2024-11-09 04:32:20,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:20,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:20,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:20,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:20,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:20,158 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 04:32:21,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:21,713 INFO L93 Difference]: Finished difference Result 9371 states and 18783 transitions. [2024-11-09 04:32:21,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:21,714 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 04:32:21,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:21,751 INFO L225 Difference]: With dead ends: 9371 [2024-11-09 04:32:21,751 INFO L226 Difference]: Without dead ends: 6751 [2024-11-09 04:32:21,760 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 04:32:21,761 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:21,762 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.1s Time] [2024-11-09 04:32:21,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6751 states. [2024-11-09 04:32:21,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6751 to 3381. [2024-11-09 04:32:21,901 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 04:32:21,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 6702 transitions. [2024-11-09 04:32:21,935 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 6702 transitions. Word has length 171 [2024-11-09 04:32:21,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:21,936 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 6702 transitions. [2024-11-09 04:32:21,936 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 04:32:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 6702 transitions. [2024-11-09 04:32:21,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:21,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:21,941 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 04:32:21,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 04:32:21,942 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 04:32:21,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:21,942 INFO L85 PathProgramCache]: Analyzing trace with hash -135173923, now seen corresponding path program 2 times [2024-11-09 04:32:21,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:21,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316610809] [2024-11-09 04:32:21,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:21,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:22,741 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 04:32:22,744 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:22,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316610809] [2024-11-09 04:32:22,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316610809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:22,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:22,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:22,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820805806] [2024-11-09 04:32:22,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:22,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:22,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:22,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:22,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:22,747 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 04:32:24,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:24,229 INFO L93 Difference]: Finished difference Result 9238 states and 18517 transitions. [2024-11-09 04:32:24,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:24,230 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 04:32:24,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:24,265 INFO L225 Difference]: With dead ends: 9238 [2024-11-09 04:32:24,265 INFO L226 Difference]: Without dead ends: 6618 [2024-11-09 04:32:24,272 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 04:32:24,273 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 04:32:24,273 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 04:32:24,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6618 states. [2024-11-09 04:32:24,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6618 to 3383. [2024-11-09 04:32:24,389 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 04:32:24,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3383 states to 3383 states and 6706 transitions. [2024-11-09 04:32:24,418 INFO L78 Accepts]: Start accepts. Automaton has 3383 states and 6706 transitions. Word has length 171 [2024-11-09 04:32:24,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:24,419 INFO L471 AbstractCegarLoop]: Abstraction has 3383 states and 6706 transitions. [2024-11-09 04:32:24,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 04:32:24,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3383 states and 6706 transitions. [2024-11-09 04:32:24,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:24,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:24,423 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 04:32:24,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 04:32:24,424 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 04:32:24,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash 907000285, now seen corresponding path program 3 times [2024-11-09 04:32:24,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:24,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856466748] [2024-11-09 04:32:24,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:24,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:25,037 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 04:32:25,037 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:25,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856466748] [2024-11-09 04:32:25,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856466748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:25,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:25,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:25,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319246175] [2024-11-09 04:32:25,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:25,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:25,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:25,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:25,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:25,040 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 04:32:26,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:26,106 INFO L93 Difference]: Finished difference Result 8429 states and 16899 transitions. [2024-11-09 04:32:26,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:26,107 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 04:32:26,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:26,140 INFO L225 Difference]: With dead ends: 8429 [2024-11-09 04:32:26,140 INFO L226 Difference]: Without dead ends: 5809 [2024-11-09 04:32:26,149 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 04:32:26,150 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 470 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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 04:32:26,150 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 04:32:26,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5809 states. [2024-11-09 04:32:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5809 to 3403. [2024-11-09 04:32:26,271 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 04:32:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 6727 transitions. [2024-11-09 04:32:26,303 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 6727 transitions. Word has length 171 [2024-11-09 04:32:26,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:26,304 INFO L471 AbstractCegarLoop]: Abstraction has 3403 states and 6727 transitions. [2024-11-09 04:32:26,304 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 04:32:26,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 6727 transitions. [2024-11-09 04:32:26,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:26,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:26,308 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 04:32:26,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 04:32:26,309 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 04:32:26,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:26,309 INFO L85 PathProgramCache]: Analyzing trace with hash -504638131, now seen corresponding path program 4 times [2024-11-09 04:32:26,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:26,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529975797] [2024-11-09 04:32:26,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:26,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:27,141 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 04:32:27,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:27,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529975797] [2024-11-09 04:32:27,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529975797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:27,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:27,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:27,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603093085] [2024-11-09 04:32:27,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:27,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:27,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:27,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:27,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:27,144 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 04:32:28,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:28,327 INFO L93 Difference]: Finished difference Result 9656 states and 19334 transitions. [2024-11-09 04:32:28,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:28,327 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 04:32:28,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:28,365 INFO L225 Difference]: With dead ends: 9656 [2024-11-09 04:32:28,365 INFO L226 Difference]: Without dead ends: 7036 [2024-11-09 04:32:28,374 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 04:32:28,375 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 404 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:28,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1481 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 04:32:28,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7036 states. [2024-11-09 04:32:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7036 to 3412. [2024-11-09 04:32:28,499 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 04:32:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3412 states to 3412 states and 6745 transitions. [2024-11-09 04:32:28,534 INFO L78 Accepts]: Start accepts. Automaton has 3412 states and 6745 transitions. Word has length 171 [2024-11-09 04:32:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:28,535 INFO L471 AbstractCegarLoop]: Abstraction has 3412 states and 6745 transitions. [2024-11-09 04:32:28,536 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 04:32:28,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3412 states and 6745 transitions. [2024-11-09 04:32:28,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:28,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:28,543 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 04:32:28,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 04:32:28,544 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 04:32:28,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:28,544 INFO L85 PathProgramCache]: Analyzing trace with hash 507508431, now seen corresponding path program 5 times [2024-11-09 04:32:28,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:28,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142684344] [2024-11-09 04:32:28,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:28,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:29,290 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 04:32:29,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:29,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142684344] [2024-11-09 04:32:29,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142684344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:29,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:29,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:29,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453056082] [2024-11-09 04:32:29,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:29,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:29,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:29,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:29,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:29,294 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 04:32:30,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:30,498 INFO L93 Difference]: Finished difference Result 10501 states and 21005 transitions. [2024-11-09 04:32:30,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:30,499 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 04:32:30,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:30,537 INFO L225 Difference]: With dead ends: 10501 [2024-11-09 04:32:30,537 INFO L226 Difference]: Without dead ends: 7881 [2024-11-09 04:32:30,548 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 04:32:30,549 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 478 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:30,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1634 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 04:32:30,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7881 states. [2024-11-09 04:32:30,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7881 to 3414. [2024-11-09 04:32:30,741 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 04:32:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3414 states to 3414 states and 6749 transitions. [2024-11-09 04:32:30,781 INFO L78 Accepts]: Start accepts. Automaton has 3414 states and 6749 transitions. Word has length 171 [2024-11-09 04:32:30,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:30,782 INFO L471 AbstractCegarLoop]: Abstraction has 3414 states and 6749 transitions. [2024-11-09 04:32:30,782 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 04:32:30,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3414 states and 6749 transitions. [2024-11-09 04:32:30,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:30,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:30,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 04:32:30,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 04:32:30,788 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 04:32:30,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:30,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1549682639, now seen corresponding path program 6 times [2024-11-09 04:32:30,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:30,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336425147] [2024-11-09 04:32:30,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:30,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:31,394 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 04:32:31,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:31,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336425147] [2024-11-09 04:32:31,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336425147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:31,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:31,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:31,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519270352] [2024-11-09 04:32:31,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:31,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:31,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:31,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:31,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:31,397 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 04:32:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:32,570 INFO L93 Difference]: Finished difference Result 9712 states and 19427 transitions. [2024-11-09 04:32:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:32,571 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 04:32:32,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:32,614 INFO L225 Difference]: With dead ends: 9712 [2024-11-09 04:32:32,614 INFO L226 Difference]: Without dead ends: 7092 [2024-11-09 04:32:32,623 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 04:32:32,624 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.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:32,624 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.8s Time] [2024-11-09 04:32:32,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7092 states. [2024-11-09 04:32:32,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7092 to 3409. [2024-11-09 04:32:32,757 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 04:32:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 6739 transitions. [2024-11-09 04:32:32,803 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 6739 transitions. Word has length 171 [2024-11-09 04:32:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:32,803 INFO L471 AbstractCegarLoop]: Abstraction has 3409 states and 6739 transitions. [2024-11-09 04:32:32,803 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 04:32:32,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 6739 transitions. [2024-11-09 04:32:32,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:32,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:32,809 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 04:32:32,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 04:32:32,809 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 04:32:32,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:32,810 INFO L85 PathProgramCache]: Analyzing trace with hash 85143245, now seen corresponding path program 7 times [2024-11-09 04:32:32,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:32,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91126187] [2024-11-09 04:32:32,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:32,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:33,579 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 04:32:33,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:33,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91126187] [2024-11-09 04:32:33,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91126187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:33,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:33,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:33,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176309009] [2024-11-09 04:32:33,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:33,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:33,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:33,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:33,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:33,590 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 04:32:34,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:34,789 INFO L93 Difference]: Finished difference Result 9470 states and 18962 transitions. [2024-11-09 04:32:34,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:34,790 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 04:32:34,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:34,849 INFO L225 Difference]: With dead ends: 9470 [2024-11-09 04:32:34,849 INFO L226 Difference]: Without dead ends: 6850 [2024-11-09 04:32:34,860 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 04:32:34,861 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 415 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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 04:32:34,861 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 04:32:34,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6850 states. [2024-11-09 04:32:34,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6850 to 3415. [2024-11-09 04:32:34,987 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 04:32:34,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 6751 transitions. [2024-11-09 04:32:35,024 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 6751 transitions. Word has length 171 [2024-11-09 04:32:35,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:35,025 INFO L471 AbstractCegarLoop]: Abstraction has 3415 states and 6751 transitions. [2024-11-09 04:32:35,025 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 04:32:35,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 6751 transitions. [2024-11-09 04:32:35,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:35,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:35,030 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 04:32:35,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 04:32:35,030 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 04:32:35,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:35,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1127317453, now seen corresponding path program 8 times [2024-11-09 04:32:35,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:35,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118780877] [2024-11-09 04:32:35,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:35,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:35,635 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 04:32:35,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:35,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118780877] [2024-11-09 04:32:35,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118780877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:35,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:35,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:35,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251887801] [2024-11-09 04:32:35,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:35,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:35,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:35,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:35,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:35,639 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 04:32:36,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:36,547 INFO L93 Difference]: Finished difference Result 9536 states and 19075 transitions. [2024-11-09 04:32:36,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:36,548 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 04:32:36,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:36,591 INFO L225 Difference]: With dead ends: 9536 [2024-11-09 04:32:36,592 INFO L226 Difference]: Without dead ends: 6916 [2024-11-09 04:32:36,601 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 04:32:36,602 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 477 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:36,603 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.6s Time] [2024-11-09 04:32:36,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6916 states. [2024-11-09 04:32:36,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6916 to 3413. [2024-11-09 04:32:36,722 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 04:32:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3413 states to 3413 states and 6747 transitions. [2024-11-09 04:32:36,759 INFO L78 Accepts]: Start accepts. Automaton has 3413 states and 6747 transitions. Word has length 171 [2024-11-09 04:32:36,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:36,760 INFO L471 AbstractCegarLoop]: Abstraction has 3413 states and 6747 transitions. [2024-11-09 04:32:36,760 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 04:32:36,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3413 states and 6747 transitions. [2024-11-09 04:32:36,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:36,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:36,765 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 04:32:36,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 04:32:36,765 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 04:32:36,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:36,766 INFO L85 PathProgramCache]: Analyzing trace with hash -292219645, now seen corresponding path program 9 times [2024-11-09 04:32:36,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:36,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858446549] [2024-11-09 04:32:36,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:36,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:37,344 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 04:32:37,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:37,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858446549] [2024-11-09 04:32:37,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858446549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:37,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:37,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:37,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403008385] [2024-11-09 04:32:37,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:37,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:37,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:37,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:37,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:37,347 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 04:32:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:38,435 INFO L93 Difference]: Finished difference Result 9423 states and 18868 transitions. [2024-11-09 04:32:38,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:38,436 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 04:32:38,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:38,469 INFO L225 Difference]: With dead ends: 9423 [2024-11-09 04:32:38,469 INFO L226 Difference]: Without dead ends: 6803 [2024-11-09 04:32:38,478 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 04:32:38,479 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 04:32:38,480 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 04:32:38,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6803 states. [2024-11-09 04:32:38,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6803 to 3415. [2024-11-09 04:32:38,600 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 04:32:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 6751 transitions. [2024-11-09 04:32:38,637 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 6751 transitions. Word has length 171 [2024-11-09 04:32:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:38,637 INFO L471 AbstractCegarLoop]: Abstraction has 3415 states and 6751 transitions. [2024-11-09 04:32:38,638 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 04:32:38,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 6751 transitions. [2024-11-09 04:32:38,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:38,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:38,642 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 04:32:38,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 04:32:38,643 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 04:32:38,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:38,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2040073867, now seen corresponding path program 10 times [2024-11-09 04:32:38,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:38,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836808671] [2024-11-09 04:32:38,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:38,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:39,245 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 04:32:39,245 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:39,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836808671] [2024-11-09 04:32:39,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836808671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:39,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:39,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:39,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882420566] [2024-11-09 04:32:39,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:39,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:39,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:39,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:39,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:39,248 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 04:32:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:40,148 INFO L93 Difference]: Finished difference Result 8519 states and 17060 transitions. [2024-11-09 04:32:40,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:40,149 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 04:32:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:40,178 INFO L225 Difference]: With dead ends: 8519 [2024-11-09 04:32:40,179 INFO L226 Difference]: Without dead ends: 5899 [2024-11-09 04:32:40,185 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 04:32:40,187 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 364 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:40,187 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.6s Time] [2024-11-09 04:32:40,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5899 states. [2024-11-09 04:32:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5899 to 3453. [2024-11-09 04:32:40,292 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 04:32:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3453 states to 3453 states and 6827 transitions. [2024-11-09 04:32:40,323 INFO L78 Accepts]: Start accepts. Automaton has 3453 states and 6827 transitions. Word has length 171 [2024-11-09 04:32:40,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:40,324 INFO L471 AbstractCegarLoop]: Abstraction has 3453 states and 6827 transitions. [2024-11-09 04:32:40,324 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 04:32:40,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3453 states and 6827 transitions. [2024-11-09 04:32:40,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:40,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:40,329 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 04:32:40,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 04:32:40,329 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 04:32:40,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:40,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2060423151, now seen corresponding path program 11 times [2024-11-09 04:32:40,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:40,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543689535] [2024-11-09 04:32:40,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:40,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:40,886 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 04:32:40,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:40,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543689535] [2024-11-09 04:32:40,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543689535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:40,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:40,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:40,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164628630] [2024-11-09 04:32:40,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:40,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:40,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:40,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:40,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:40,888 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 04:32:41,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:41,897 INFO L93 Difference]: Finished difference Result 9916 states and 19854 transitions. [2024-11-09 04:32:41,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:41,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 04:32:41,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:41,932 INFO L225 Difference]: With dead ends: 9916 [2024-11-09 04:32:41,932 INFO L226 Difference]: Without dead ends: 7296 [2024-11-09 04:32:41,941 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 04:32:41,942 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 396 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:41,942 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.7s Time] [2024-11-09 04:32:41,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7296 states. [2024-11-09 04:32:42,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7296 to 3471. [2024-11-09 04:32:42,094 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 04:32:42,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 6863 transitions. [2024-11-09 04:32:42,146 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 6863 transitions. Word has length 171 [2024-11-09 04:32:42,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:42,147 INFO L471 AbstractCegarLoop]: Abstraction has 3471 states and 6863 transitions. [2024-11-09 04:32:42,148 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 04:32:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 6863 transitions. [2024-11-09 04:32:42,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:42,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:42,155 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 04:32:42,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 04:32:42,155 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 04:32:42,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:42,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1222397583, now seen corresponding path program 12 times [2024-11-09 04:32:42,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:42,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157924206] [2024-11-09 04:32:42,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:42,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:42,823 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 04:32:42,823 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:42,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157924206] [2024-11-09 04:32:42,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157924206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:42,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:42,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:42,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840445142] [2024-11-09 04:32:42,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:42,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:42,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:42,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:42,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:42,826 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 04:32:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:43,739 INFO L93 Difference]: Finished difference Result 10761 states and 21525 transitions. [2024-11-09 04:32:43,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:43,739 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 04:32:43,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:43,772 INFO L225 Difference]: With dead ends: 10761 [2024-11-09 04:32:43,772 INFO L226 Difference]: Without dead ends: 8141 [2024-11-09 04:32:43,779 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 04:32:43,780 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 414 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:43,780 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.6s Time] [2024-11-09 04:32:43,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8141 states. [2024-11-09 04:32:43,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8141 to 3473. [2024-11-09 04:32:43,944 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 04:32:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 6867 transitions. [2024-11-09 04:32:43,977 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 6867 transitions. Word has length 171 [2024-11-09 04:32:43,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:43,977 INFO L471 AbstractCegarLoop]: Abstraction has 3473 states and 6867 transitions. [2024-11-09 04:32:43,978 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 04:32:43,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 6867 transitions. [2024-11-09 04:32:43,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:43,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:43,985 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 04:32:43,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 04:32:43,985 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 04:32:43,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:43,986 INFO L85 PathProgramCache]: Analyzing trace with hash -180223375, now seen corresponding path program 13 times [2024-11-09 04:32:43,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:43,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964108081] [2024-11-09 04:32:43,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:43,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:44,456 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 04:32:44,456 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:44,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964108081] [2024-11-09 04:32:44,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964108081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:44,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:44,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:44,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677641709] [2024-11-09 04:32:44,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:44,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:44,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:44,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:44,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:44,459 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 04:32:45,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:45,456 INFO L93 Difference]: Finished difference Result 9972 states and 19947 transitions. [2024-11-09 04:32:45,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:45,457 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 04:32:45,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:45,490 INFO L225 Difference]: With dead ends: 9972 [2024-11-09 04:32:45,490 INFO L226 Difference]: Without dead ends: 7352 [2024-11-09 04:32:45,497 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 04:32:45,497 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 04:32:45,497 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 04:32:45,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7352 states. [2024-11-09 04:32:45,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7352 to 3468. [2024-11-09 04:32:45,630 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 04:32:45,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3468 states to 3468 states and 6857 transitions. [2024-11-09 04:32:45,672 INFO L78 Accepts]: Start accepts. Automaton has 3468 states and 6857 transitions. Word has length 171 [2024-11-09 04:32:45,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:45,673 INFO L471 AbstractCegarLoop]: Abstraction has 3468 states and 6857 transitions. [2024-11-09 04:32:45,673 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 04:32:45,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3468 states and 6857 transitions. [2024-11-09 04:32:45,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:45,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:45,676 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 04:32:45,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 04:32:45,677 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 04:32:45,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:45,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1644762769, now seen corresponding path program 14 times [2024-11-09 04:32:45,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:45,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074577012] [2024-11-09 04:32:45,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:45,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:46,260 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 04:32:46,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:46,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074577012] [2024-11-09 04:32:46,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074577012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:46,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:46,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:46,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356586812] [2024-11-09 04:32:46,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:46,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:46,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:46,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:46,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:46,263 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 04:32:47,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:47,316 INFO L93 Difference]: Finished difference Result 10978 states and 21940 transitions. [2024-11-09 04:32:47,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:47,317 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 04:32:47,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:47,351 INFO L225 Difference]: With dead ends: 10978 [2024-11-09 04:32:47,351 INFO L226 Difference]: Without dead ends: 8358 [2024-11-09 04:32:47,357 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 04:32:47,358 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 424 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:47,359 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.7s Time] [2024-11-09 04:32:47,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8358 states. [2024-11-09 04:32:47,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8358 to 3474. [2024-11-09 04:32:47,501 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 04:32:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 6869 transitions. [2024-11-09 04:32:47,547 INFO L78 Accepts]: Start accepts. Automaton has 3474 states and 6869 transitions. Word has length 171 [2024-11-09 04:32:47,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:47,548 INFO L471 AbstractCegarLoop]: Abstraction has 3474 states and 6869 transitions. [2024-11-09 04:32:47,548 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 04:32:47,549 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 6869 transitions. [2024-11-09 04:32:47,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:47,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:47,552 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 04:32:47,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 04:32:47,552 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 04:32:47,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:47,553 INFO L85 PathProgramCache]: Analyzing trace with hash -602588561, now seen corresponding path program 15 times [2024-11-09 04:32:47,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:47,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297415238] [2024-11-09 04:32:47,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:47,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:48,140 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 04:32:48,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:48,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297415238] [2024-11-09 04:32:48,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297415238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:48,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:48,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:48,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215125422] [2024-11-09 04:32:48,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:48,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:48,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:48,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:48,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:48,144 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 04:32:49,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:49,186 INFO L93 Difference]: Finished difference Result 11044 states and 22053 transitions. [2024-11-09 04:32:49,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:49,187 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 04:32:49,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:49,218 INFO L225 Difference]: With dead ends: 11044 [2024-11-09 04:32:49,218 INFO L226 Difference]: Without dead ends: 8424 [2024-11-09 04:32:49,225 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 04:32:49,225 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.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:49,225 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.7s Time] [2024-11-09 04:32:49,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8424 states. [2024-11-09 04:32:49,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8424 to 3472. [2024-11-09 04:32:49,324 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 04:32:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 6865 transitions. [2024-11-09 04:32:49,358 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 6865 transitions. Word has length 171 [2024-11-09 04:32:49,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:49,358 INFO L471 AbstractCegarLoop]: Abstraction has 3472 states and 6865 transitions. [2024-11-09 04:32:49,358 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 04:32:49,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 6865 transitions. [2024-11-09 04:32:49,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:49,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:49,360 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 04:32:49,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 04:32:49,361 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 04:32:49,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:49,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2022125659, now seen corresponding path program 16 times [2024-11-09 04:32:49,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:49,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123330893] [2024-11-09 04:32:49,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:49,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:49,949 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 04:32:49,949 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:49,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123330893] [2024-11-09 04:32:49,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123330893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:49,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:49,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:49,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280422741] [2024-11-09 04:32:49,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:49,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:49,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:49,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:49,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:49,953 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 04:32:51,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:51,145 INFO L93 Difference]: Finished difference Result 10931 states and 21846 transitions. [2024-11-09 04:32:51,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:51,146 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 04:32:51,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:51,203 INFO L225 Difference]: With dead ends: 10931 [2024-11-09 04:32:51,204 INFO L226 Difference]: Without dead ends: 8311 [2024-11-09 04:32:51,213 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 04:32:51,213 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 04:32:51,215 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 04:32:51,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8311 states. [2024-11-09 04:32:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8311 to 3474. [2024-11-09 04:32:51,352 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 04:32:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 6869 transitions. [2024-11-09 04:32:51,402 INFO L78 Accepts]: Start accepts. Automaton has 3474 states and 6869 transitions. Word has length 171 [2024-11-09 04:32:51,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:51,403 INFO L471 AbstractCegarLoop]: Abstraction has 3474 states and 6869 transitions. [2024-11-09 04:32:51,403 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 04:32:51,404 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 6869 transitions. [2024-11-09 04:32:51,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:51,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:51,407 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 04:32:51,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 04:32:51,407 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 04:32:51,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash 310167853, now seen corresponding path program 17 times [2024-11-09 04:32:51,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:51,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59541643] [2024-11-09 04:32:51,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:51,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:51,857 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 04:32:51,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:51,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59541643] [2024-11-09 04:32:51,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59541643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:51,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:51,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:51,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355268790] [2024-11-09 04:32:51,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:51,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:51,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:51,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:51,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:51,859 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 04:32:52,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:52,658 INFO L93 Difference]: Finished difference Result 10047 states and 20078 transitions. [2024-11-09 04:32:52,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:52,658 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 04:32:52,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:52,709 INFO L225 Difference]: With dead ends: 10047 [2024-11-09 04:32:52,709 INFO L226 Difference]: Without dead ends: 7427 [2024-11-09 04:32:52,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-09 04:32:52,721 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 397 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:52,721 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.5s Time] [2024-11-09 04:32:52,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7427 states. [2024-11-09 04:32:52,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7427 to 3462. [2024-11-09 04:32:52,882 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 04:32:52,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 6845 transitions. [2024-11-09 04:32:52,925 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 6845 transitions. Word has length 171 [2024-11-09 04:32:52,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:52,926 INFO L471 AbstractCegarLoop]: Abstraction has 3462 states and 6845 transitions. [2024-11-09 04:32:52,926 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 04:32:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 6845 transitions. [2024-11-09 04:32:52,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:52,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:52,929 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 04:32:52,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 04:32:52,929 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 04:32:52,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:52,930 INFO L85 PathProgramCache]: Analyzing trace with hash 654366797, now seen corresponding path program 18 times [2024-11-09 04:32:52,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:52,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355466679] [2024-11-09 04:32:52,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:52,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:53,410 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 04:32:53,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:53,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355466679] [2024-11-09 04:32:53,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355466679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:53,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:53,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:53,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542411040] [2024-11-09 04:32:53,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:53,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:53,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:53,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:53,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:53,413 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 04:32:54,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:54,204 INFO L93 Difference]: Finished difference Result 9715 states and 19452 transitions. [2024-11-09 04:32:54,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:54,205 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 04:32:54,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:54,240 INFO L225 Difference]: With dead ends: 9715 [2024-11-09 04:32:54,240 INFO L226 Difference]: Without dead ends: 7095 [2024-11-09 04:32:54,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 04:32:54,248 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 409 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:54,248 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.5s Time] [2024-11-09 04:32:54,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7095 states. [2024-11-09 04:32:54,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7095 to 3474. [2024-11-09 04:32:54,345 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 04:32:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 6869 transitions. [2024-11-09 04:32:54,391 INFO L78 Accepts]: Start accepts. Automaton has 3474 states and 6869 transitions. Word has length 171 [2024-11-09 04:32:54,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:54,392 INFO L471 AbstractCegarLoop]: Abstraction has 3474 states and 6869 transitions. [2024-11-09 04:32:54,392 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 04:32:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 6869 transitions. [2024-11-09 04:32:54,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:54,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:54,395 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 04:32:54,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 04:32:54,396 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 04:32:54,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:54,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1696541005, now seen corresponding path program 19 times [2024-11-09 04:32:54,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:54,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904712542] [2024-11-09 04:32:54,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:54,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:54,977 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 04:32:54,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:54,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904712542] [2024-11-09 04:32:54,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904712542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:54,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:54,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:54,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835297305] [2024-11-09 04:32:54,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:54,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:54,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:54,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:54,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:54,979 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 04:32:55,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:55,881 INFO L93 Difference]: Finished difference Result 9781 states and 19565 transitions. [2024-11-09 04:32:55,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:55,882 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 04:32:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:55,923 INFO L225 Difference]: With dead ends: 9781 [2024-11-09 04:32:55,923 INFO L226 Difference]: Without dead ends: 7161 [2024-11-09 04:32:55,933 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 04:32:55,933 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 447 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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 04:32:55,934 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 04:32:55,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7161 states. [2024-11-09 04:32:56,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7161 to 3472. [2024-11-09 04:32:56,050 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 04:32:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 6865 transitions. [2024-11-09 04:32:56,092 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 6865 transitions. Word has length 171 [2024-11-09 04:32:56,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:56,093 INFO L471 AbstractCegarLoop]: Abstraction has 3472 states and 6865 transitions. [2024-11-09 04:32:56,094 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 04:32:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 6865 transitions. [2024-11-09 04:32:56,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:56,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:56,097 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 04:32:56,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 04:32:56,097 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 04:32:56,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:56,098 INFO L85 PathProgramCache]: Analyzing trace with hash 277003907, now seen corresponding path program 20 times [2024-11-09 04:32:56,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:56,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267422200] [2024-11-09 04:32:56,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:56,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:56,626 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 04:32:56,626 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:56,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267422200] [2024-11-09 04:32:56,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267422200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:56,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:56,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:56,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535385498] [2024-11-09 04:32:56,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:56,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:56,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:56,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:56,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:56,629 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 04:32:57,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:57,541 INFO L93 Difference]: Finished difference Result 10721 states and 21426 transitions. [2024-11-09 04:32:57,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:57,542 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 04:32:57,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:57,579 INFO L225 Difference]: With dead ends: 10721 [2024-11-09 04:32:57,579 INFO L226 Difference]: Without dead ends: 8101 [2024-11-09 04:32:57,586 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 04:32:57,587 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 04:32:57,587 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 04:32:57,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8101 states. [2024-11-09 04:32:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8101 to 3474. [2024-11-09 04:32:57,691 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 04:32:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 6869 transitions. [2024-11-09 04:32:57,731 INFO L78 Accepts]: Start accepts. Automaton has 3474 states and 6869 transitions. Word has length 171 [2024-11-09 04:32:57,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:57,732 INFO L471 AbstractCegarLoop]: Abstraction has 3474 states and 6869 transitions. [2024-11-09 04:32:57,732 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 04:32:57,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 6869 transitions. [2024-11-09 04:32:57,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:57,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:57,734 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 04:32:57,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 04:32:57,735 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 04:32:57,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:57,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1685669877, now seen corresponding path program 21 times [2024-11-09 04:32:57,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:57,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27487657] [2024-11-09 04:32:57,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:57,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:58,238 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 04:32:58,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:58,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27487657] [2024-11-09 04:32:58,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27487657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:58,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:58,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:58,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86535993] [2024-11-09 04:32:58,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:58,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:58,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:58,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:58,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:58,240 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 04:32:59,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:59,072 INFO L93 Difference]: Finished difference Result 9847 states and 19678 transitions. [2024-11-09 04:32:59,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:32:59,072 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 04:32:59,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:59,111 INFO L225 Difference]: With dead ends: 9847 [2024-11-09 04:32:59,111 INFO L226 Difference]: Without dead ends: 7227 [2024-11-09 04:32:59,118 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 04:32:59,119 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 383 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:59,119 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.5s Time] [2024-11-09 04:32:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7227 states. [2024-11-09 04:32:59,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7227 to 3468. [2024-11-09 04:32:59,226 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 04:32:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3468 states to 3468 states and 6857 transitions. [2024-11-09 04:32:59,267 INFO L78 Accepts]: Start accepts. Automaton has 3468 states and 6857 transitions. Word has length 171 [2024-11-09 04:32:59,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:59,267 INFO L471 AbstractCegarLoop]: Abstraction has 3468 states and 6857 transitions. [2024-11-09 04:32:59,267 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 04:32:59,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3468 states and 6857 transitions. [2024-11-09 04:32:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:32:59,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:59,269 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 04:32:59,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 04:32:59,270 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 04:32:59,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:59,271 INFO L85 PathProgramCache]: Analyzing trace with hash 467544963, now seen corresponding path program 22 times [2024-11-09 04:32:59,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:32:59,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921220478] [2024-11-09 04:32:59,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:59,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:59,993 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 04:32:59,993 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:32:59,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921220478] [2024-11-09 04:32:59,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921220478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:59,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:59,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:32:59,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760488139] [2024-11-09 04:32:59,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:59,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:32:59,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:32:59,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:32:59,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:59,996 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 04:33:01,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:01,148 INFO L93 Difference]: Finished difference Result 9659 states and 19340 transitions. [2024-11-09 04:33:01,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:01,149 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 04:33:01,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:01,186 INFO L225 Difference]: With dead ends: 9659 [2024-11-09 04:33:01,186 INFO L226 Difference]: Without dead ends: 7039 [2024-11-09 04:33:01,193 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 04:33:01,193 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 449 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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 04:33:01,194 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 04:33:01,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7039 states. [2024-11-09 04:33:01,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7039 to 3473. [2024-11-09 04:33:01,334 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 04:33:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 6867 transitions. [2024-11-09 04:33:01,376 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 6867 transitions. Word has length 171 [2024-11-09 04:33:01,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:01,376 INFO L471 AbstractCegarLoop]: Abstraction has 3473 states and 6867 transitions. [2024-11-09 04:33:01,376 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 04:33:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 6867 transitions. [2024-11-09 04:33:01,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:01,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:01,380 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 04:33:01,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 04:33:01,380 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 04:33:01,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:01,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1495128821, now seen corresponding path program 23 times [2024-11-09 04:33:01,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:01,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060044315] [2024-11-09 04:33:01,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:01,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:01,842 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 04:33:01,842 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:01,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060044315] [2024-11-09 04:33:01,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060044315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:01,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:01,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:01,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659632331] [2024-11-09 04:33:01,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:01,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:01,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:01,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:01,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:01,845 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 04:33:02,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:02,931 INFO L93 Difference]: Finished difference Result 9697 states and 19378 transitions. [2024-11-09 04:33:02,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:02,931 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 04:33:02,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:02,966 INFO L225 Difference]: With dead ends: 9697 [2024-11-09 04:33:02,966 INFO L226 Difference]: Without dead ends: 7077 [2024-11-09 04:33:02,971 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 04:33:02,971 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 362 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:02,971 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.7s Time] [2024-11-09 04:33:02,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7077 states. [2024-11-09 04:33:03,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7077 to 3471. [2024-11-09 04:33:03,071 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 04:33:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 6863 transitions. [2024-11-09 04:33:03,107 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 6863 transitions. Word has length 171 [2024-11-09 04:33:03,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:03,108 INFO L471 AbstractCegarLoop]: Abstraction has 3471 states and 6863 transitions. [2024-11-09 04:33:03,108 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 04:33:03,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 6863 transitions. [2024-11-09 04:33:03,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:03,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:03,110 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 04:33:03,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 04:33:03,110 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 04:33:03,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:03,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1380582637, now seen corresponding path program 24 times [2024-11-09 04:33:03,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:03,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455852411] [2024-11-09 04:33:03,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:03,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:03,592 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 04:33:03,593 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:03,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455852411] [2024-11-09 04:33:03,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455852411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:03,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:03,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:03,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197816530] [2024-11-09 04:33:03,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:03,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:03,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:03,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:03,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:03,596 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 04:33:04,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:04,576 INFO L93 Difference]: Finished difference Result 8707 states and 17436 transitions. [2024-11-09 04:33:04,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:04,577 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 04:33:04,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:04,626 INFO L225 Difference]: With dead ends: 8707 [2024-11-09 04:33:04,626 INFO L226 Difference]: Without dead ends: 6087 [2024-11-09 04:33:04,632 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 04:33:04,632 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 04:33:04,633 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 04:33:04,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6087 states. [2024-11-09 04:33:04,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6087 to 3528. [2024-11-09 04:33:04,781 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 04:33:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3528 states and 6977 transitions. [2024-11-09 04:33:04,826 INFO L78 Accepts]: Start accepts. Automaton has 3528 states and 6977 transitions. Word has length 171 [2024-11-09 04:33:04,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:04,826 INFO L471 AbstractCegarLoop]: Abstraction has 3528 states and 6977 transitions. [2024-11-09 04:33:04,826 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 04:33:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 6977 transitions. [2024-11-09 04:33:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:04,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:04,828 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 04:33:04,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 04:33:04,829 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 04:33:04,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:04,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1736990115, now seen corresponding path program 25 times [2024-11-09 04:33:04,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:04,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853194833] [2024-11-09 04:33:04,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:04,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:05,391 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 04:33:05,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:05,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853194833] [2024-11-09 04:33:05,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853194833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:05,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:05,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:05,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759638861] [2024-11-09 04:33:05,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:05,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:05,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:05,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:05,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:05,394 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 04:33:06,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:06,427 INFO L93 Difference]: Finished difference Result 9659 states and 19360 transitions. [2024-11-09 04:33:06,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:06,428 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 04:33:06,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:06,471 INFO L225 Difference]: With dead ends: 9659 [2024-11-09 04:33:06,471 INFO L226 Difference]: Without dead ends: 7039 [2024-11-09 04:33:06,477 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 04:33:06,478 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 359 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:06,478 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.7s Time] [2024-11-09 04:33:06,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7039 states. [2024-11-09 04:33:06,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7039 to 3543. [2024-11-09 04:33:06,625 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 04:33:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 3543 states and 7007 transitions. [2024-11-09 04:33:06,668 INFO L78 Accepts]: Start accepts. Automaton has 3543 states and 7007 transitions. Word has length 171 [2024-11-09 04:33:06,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:06,668 INFO L471 AbstractCegarLoop]: Abstraction has 3543 states and 7007 transitions. [2024-11-09 04:33:06,668 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 04:33:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3543 states and 7007 transitions. [2024-11-09 04:33:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:06,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:06,670 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 04:33:06,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 04:33:06,671 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 04:33:06,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:06,671 INFO L85 PathProgramCache]: Analyzing trace with hash 307847133, now seen corresponding path program 26 times [2024-11-09 04:33:06,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:06,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868485106] [2024-11-09 04:33:06,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:06,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:07,126 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 04:33:07,126 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:07,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868485106] [2024-11-09 04:33:07,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868485106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:07,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:07,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:07,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471743504] [2024-11-09 04:33:07,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:07,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:07,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:07,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:07,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:07,129 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 04:33:08,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:08,075 INFO L93 Difference]: Finished difference Result 8977 states and 17977 transitions. [2024-11-09 04:33:08,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:08,076 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 04:33:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:08,116 INFO L225 Difference]: With dead ends: 8977 [2024-11-09 04:33:08,116 INFO L226 Difference]: Without dead ends: 6357 [2024-11-09 04:33:08,121 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 04:33:08,122 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 04:33:08,122 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 04:33:08,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6357 states. [2024-11-09 04:33:08,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6357 to 3545. [2024-11-09 04:33:08,259 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 04:33:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3545 states to 3545 states and 7011 transitions. [2024-11-09 04:33:08,370 INFO L78 Accepts]: Start accepts. Automaton has 3545 states and 7011 transitions. Word has length 171 [2024-11-09 04:33:08,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:08,371 INFO L471 AbstractCegarLoop]: Abstraction has 3545 states and 7011 transitions. [2024-11-09 04:33:08,371 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 04:33:08,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3545 states and 7011 transitions. [2024-11-09 04:33:08,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:08,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:08,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 04:33:08,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-09 04:33:08,375 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 04:33:08,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:08,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1654826651, now seen corresponding path program 27 times [2024-11-09 04:33:08,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:08,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253097120] [2024-11-09 04:33:08,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:08,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:08,768 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 04:33:08,768 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:08,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253097120] [2024-11-09 04:33:08,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253097120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:08,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:08,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:08,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565329543] [2024-11-09 04:33:08,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:08,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:08,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:08,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:08,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:08,770 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 04:33:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:09,795 INFO L93 Difference]: Finished difference Result 9015 states and 18015 transitions. [2024-11-09 04:33:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:09,796 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 04:33:09,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:09,836 INFO L225 Difference]: With dead ends: 9015 [2024-11-09 04:33:09,837 INFO L226 Difference]: Without dead ends: 6395 [2024-11-09 04:33:09,842 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 04:33:09,843 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 04:33:09,843 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 04:33:09,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6395 states. [2024-11-09 04:33:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6395 to 3540. [2024-11-09 04:33:09,976 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 04:33:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3540 states to 3540 states and 7001 transitions. [2024-11-09 04:33:10,024 INFO L78 Accepts]: Start accepts. Automaton has 3540 states and 7001 transitions. Word has length 171 [2024-11-09 04:33:10,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:10,025 INFO L471 AbstractCegarLoop]: Abstraction has 3540 states and 7001 transitions. [2024-11-09 04:33:10,025 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 04:33:10,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3540 states and 7001 transitions. [2024-11-09 04:33:10,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:10,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:10,027 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 04:33:10,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-09 04:33:10,027 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 04:33:10,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:10,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1398898229, now seen corresponding path program 28 times [2024-11-09 04:33:10,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:10,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678875079] [2024-11-09 04:33:10,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:10,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:10,421 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 04:33:10,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:10,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678875079] [2024-11-09 04:33:10,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678875079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:10,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:10,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:10,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436359143] [2024-11-09 04:33:10,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:10,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:10,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:10,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:10,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:10,423 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 04:33:11,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:11,599 INFO L93 Difference]: Finished difference Result 8798 states and 17657 transitions. [2024-11-09 04:33:11,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:11,600 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 04:33:11,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:11,668 INFO L225 Difference]: With dead ends: 8798 [2024-11-09 04:33:11,668 INFO L226 Difference]: Without dead ends: 6178 [2024-11-09 04:33:11,674 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 04:33:11,675 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 04:33:11,675 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 04:33:11,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6178 states. [2024-11-09 04:33:11,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6178 to 3597. [2024-11-09 04:33:11,837 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 04:33:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 7115 transitions. [2024-11-09 04:33:11,893 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 7115 transitions. Word has length 171 [2024-11-09 04:33:11,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:11,893 INFO L471 AbstractCegarLoop]: Abstraction has 3597 states and 7115 transitions. [2024-11-09 04:33:11,893 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 04:33:11,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 7115 transitions. [2024-11-09 04:33:11,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:11,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:11,897 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 04:33:11,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-09 04:33:11,898 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 04:33:11,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:11,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1450156011, now seen corresponding path program 29 times [2024-11-09 04:33:11,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:11,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93945001] [2024-11-09 04:33:11,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:11,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:12,331 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 04:33:12,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:12,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93945001] [2024-11-09 04:33:12,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93945001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:12,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:12,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:12,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069585079] [2024-11-09 04:33:12,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:12,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:12,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:12,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:12,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:12,334 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 04:33:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:13,435 INFO L93 Difference]: Finished difference Result 9319 states and 18642 transitions. [2024-11-09 04:33:13,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:13,435 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 04:33:13,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:13,479 INFO L225 Difference]: With dead ends: 9319 [2024-11-09 04:33:13,479 INFO L226 Difference]: Without dead ends: 6699 [2024-11-09 04:33:13,485 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 04:33:13,485 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 04:33:13,485 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 04:33:13,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6699 states. [2024-11-09 04:33:13,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6699 to 3606. [2024-11-09 04:33:13,598 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 04:33:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3606 states to 3606 states and 7133 transitions. [2024-11-09 04:33:13,647 INFO L78 Accepts]: Start accepts. Automaton has 3606 states and 7133 transitions. Word has length 171 [2024-11-09 04:33:13,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:13,647 INFO L471 AbstractCegarLoop]: Abstraction has 3606 states and 7133 transitions. [2024-11-09 04:33:13,647 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 04:33:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 7133 transitions. [2024-11-09 04:33:13,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:13,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:13,650 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 04:33:13,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-09 04:33:13,650 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 04:33:13,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:13,650 INFO L85 PathProgramCache]: Analyzing trace with hash 594681237, now seen corresponding path program 30 times [2024-11-09 04:33:13,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:13,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524546457] [2024-11-09 04:33:13,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:13,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:14,123 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 04:33:14,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:14,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524546457] [2024-11-09 04:33:14,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524546457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:14,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:14,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:14,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486276949] [2024-11-09 04:33:14,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:14,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:14,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:14,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:14,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:14,125 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 04:33:15,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:15,079 INFO L93 Difference]: Finished difference Result 10183 states and 20351 transitions. [2024-11-09 04:33:15,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:15,080 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 04:33:15,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:15,127 INFO L225 Difference]: With dead ends: 10183 [2024-11-09 04:33:15,127 INFO L226 Difference]: Without dead ends: 7563 [2024-11-09 04:33:15,133 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 04:33:15,134 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 466 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:15,134 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.6s Time] [2024-11-09 04:33:15,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7563 states. [2024-11-09 04:33:15,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7563 to 3608. [2024-11-09 04:33:15,250 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 04:33:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3608 states to 3608 states and 7137 transitions. [2024-11-09 04:33:15,301 INFO L78 Accepts]: Start accepts. Automaton has 3608 states and 7137 transitions. Word has length 171 [2024-11-09 04:33:15,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:15,302 INFO L471 AbstractCegarLoop]: Abstraction has 3608 states and 7137 transitions. [2024-11-09 04:33:15,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 04:33:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3608 states and 7137 transitions. [2024-11-09 04:33:15,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:15,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:15,305 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 04:33:15,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-09 04:33:15,305 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 04:33:15,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:15,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1367992547, now seen corresponding path program 31 times [2024-11-09 04:33:15,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:15,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255054407] [2024-11-09 04:33:15,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:15,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:15,721 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 04:33:15,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:15,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255054407] [2024-11-09 04:33:15,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255054407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:15,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:15,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:15,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558747554] [2024-11-09 04:33:15,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:15,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:15,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:15,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:15,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:15,724 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 04:33:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:16,690 INFO L93 Difference]: Finished difference Result 9432 states and 18811 transitions. [2024-11-09 04:33:16,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:16,690 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 04:33:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:16,739 INFO L225 Difference]: With dead ends: 9432 [2024-11-09 04:33:16,739 INFO L226 Difference]: Without dead ends: 6812 [2024-11-09 04:33:16,745 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 04:33:16,746 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 360 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:16,746 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.6s Time] [2024-11-09 04:33:16,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6812 states. [2024-11-09 04:33:16,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6812 to 3603. [2024-11-09 04:33:16,870 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 04:33:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 3603 states and 7127 transitions. [2024-11-09 04:33:16,925 INFO L78 Accepts]: Start accepts. Automaton has 3603 states and 7127 transitions. Word has length 171 [2024-11-09 04:33:16,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:16,926 INFO L471 AbstractCegarLoop]: Abstraction has 3603 states and 7127 transitions. [2024-11-09 04:33:16,926 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 04:33:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3603 states and 7127 transitions. [2024-11-09 04:33:16,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:16,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:16,930 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 04:33:16,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-09 04:33:16,931 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 04:33:16,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:16,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1162482667, now seen corresponding path program 32 times [2024-11-09 04:33:16,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:16,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746532898] [2024-11-09 04:33:16,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:16,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:17,351 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 04:33:17,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:17,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746532898] [2024-11-09 04:33:17,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746532898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:17,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:17,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:17,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683625448] [2024-11-09 04:33:17,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:17,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:17,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:17,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:17,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:17,353 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 04:33:18,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:18,210 INFO L93 Difference]: Finished difference Result 9940 states and 19884 transitions. [2024-11-09 04:33:18,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:18,211 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 04:33:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:18,255 INFO L225 Difference]: With dead ends: 9940 [2024-11-09 04:33:18,255 INFO L226 Difference]: Without dead ends: 7320 [2024-11-09 04:33:18,261 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 04:33:18,261 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 463 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:18,262 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.5s Time] [2024-11-09 04:33:18,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7320 states. [2024-11-09 04:33:18,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7320 to 3609. [2024-11-09 04:33:18,379 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 04:33:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 3609 states and 7139 transitions. [2024-11-09 04:33:18,428 INFO L78 Accepts]: Start accepts. Automaton has 3609 states and 7139 transitions. Word has length 171 [2024-11-09 04:33:18,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:18,428 INFO L471 AbstractCegarLoop]: Abstraction has 3609 states and 7139 transitions. [2024-11-09 04:33:18,429 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 04:33:18,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 7139 transitions. [2024-11-09 04:33:18,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:18,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:18,431 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 04:33:18,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-09 04:33:18,431 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 04:33:18,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:18,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1169810845, now seen corresponding path program 33 times [2024-11-09 04:33:18,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:18,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317488603] [2024-11-09 04:33:18,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:18,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:18,783 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 04:33:18,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:18,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317488603] [2024-11-09 04:33:18,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317488603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:18,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:18,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:18,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619619277] [2024-11-09 04:33:18,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:18,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:18,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:18,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:18,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:18,786 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 04:33:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:19,711 INFO L93 Difference]: Finished difference Result 9172 states and 18310 transitions. [2024-11-09 04:33:19,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:19,712 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 04:33:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:19,756 INFO L225 Difference]: With dead ends: 9172 [2024-11-09 04:33:19,757 INFO L226 Difference]: Without dead ends: 6552 [2024-11-09 04:33:19,763 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 04:33:19,764 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 368 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:19,764 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.6s Time] [2024-11-09 04:33:19,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6552 states. [2024-11-09 04:33:19,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6552 to 3607. [2024-11-09 04:33:19,882 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 04:33:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3607 states to 3607 states and 7135 transitions. [2024-11-09 04:33:19,932 INFO L78 Accepts]: Start accepts. Automaton has 3607 states and 7135 transitions. Word has length 171 [2024-11-09 04:33:19,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:19,932 INFO L471 AbstractCegarLoop]: Abstraction has 3607 states and 7135 transitions. [2024-11-09 04:33:19,932 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 04:33:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3607 states and 7135 transitions. [2024-11-09 04:33:19,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:19,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:19,935 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 04:33:19,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-09 04:33:19,935 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 04:33:19,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:19,936 INFO L85 PathProgramCache]: Analyzing trace with hash -568739789, now seen corresponding path program 34 times [2024-11-09 04:33:19,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:19,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508966311] [2024-11-09 04:33:19,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:19,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:20,401 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 04:33:20,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:20,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508966311] [2024-11-09 04:33:20,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508966311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:20,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:20,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:20,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423836554] [2024-11-09 04:33:20,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:20,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:20,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:20,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:20,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:20,403 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 04:33:21,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:21,333 INFO L93 Difference]: Finished difference Result 9086 states and 18176 transitions. [2024-11-09 04:33:21,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:21,334 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 04:33:21,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:21,380 INFO L225 Difference]: With dead ends: 9086 [2024-11-09 04:33:21,380 INFO L226 Difference]: Without dead ends: 6466 [2024-11-09 04:33:21,386 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 04:33:21,386 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 04:33:21,387 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 04:33:21,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6466 states. [2024-11-09 04:33:21,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6466 to 3609. [2024-11-09 04:33:21,522 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 04:33:21,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 3609 states and 7139 transitions. [2024-11-09 04:33:21,574 INFO L78 Accepts]: Start accepts. Automaton has 3609 states and 7139 transitions. Word has length 171 [2024-11-09 04:33:21,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:21,574 INFO L471 AbstractCegarLoop]: Abstraction has 3609 states and 7139 transitions. [2024-11-09 04:33:21,574 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 04:33:21,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 7139 transitions. [2024-11-09 04:33:21,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:21,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:21,577 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 04:33:21,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-09 04:33:21,577 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 04:33:21,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:21,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1523078975, now seen corresponding path program 35 times [2024-11-09 04:33:21,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:21,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540411703] [2024-11-09 04:33:21,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:21,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:21,911 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 04:33:21,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:21,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540411703] [2024-11-09 04:33:21,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540411703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:21,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:21,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:21,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205237869] [2024-11-09 04:33:21,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:21,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:21,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:21,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:21,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:21,914 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 04:33:22,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:22,766 INFO L93 Difference]: Finished difference Result 8182 states and 16368 transitions. [2024-11-09 04:33:22,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:22,766 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 04:33:22,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:22,818 INFO L225 Difference]: With dead ends: 8182 [2024-11-09 04:33:22,818 INFO L226 Difference]: Without dead ends: 5562 [2024-11-09 04:33:22,824 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 04:33:22,824 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 04:33:22,825 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 04:33:22,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2024-11-09 04:33:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 3597. [2024-11-09 04:33:22,959 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 04:33:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 7115 transitions. [2024-11-09 04:33:23,173 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 7115 transitions. Word has length 171 [2024-11-09 04:33:23,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:23,173 INFO L471 AbstractCegarLoop]: Abstraction has 3597 states and 7115 transitions. [2024-11-09 04:33:23,174 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 04:33:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 7115 transitions. [2024-11-09 04:33:23,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:23,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:23,177 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 04:33:23,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-09 04:33:23,177 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 04:33:23,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:23,178 INFO L85 PathProgramCache]: Analyzing trace with hash -898270951, now seen corresponding path program 36 times [2024-11-09 04:33:23,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:23,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555953889] [2024-11-09 04:33:23,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:23,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:23,702 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 04:33:23,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:23,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555953889] [2024-11-09 04:33:23,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555953889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:23,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:23,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:23,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482316588] [2024-11-09 04:33:23,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:23,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:23,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:23,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:23,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:23,704 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 04:33:24,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:24,924 INFO L93 Difference]: Finished difference Result 9529 states and 19062 transitions. [2024-11-09 04:33:24,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:24,925 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 04:33:24,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:24,976 INFO L225 Difference]: With dead ends: 9529 [2024-11-09 04:33:24,976 INFO L226 Difference]: Without dead ends: 6909 [2024-11-09 04:33:24,982 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 04:33:24,982 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 352 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:24,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1720 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 04:33:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6909 states. [2024-11-09 04:33:25,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6909 to 3611. [2024-11-09 04:33:25,105 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 04:33:25,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3611 states to 3611 states and 7143 transitions. [2024-11-09 04:33:25,154 INFO L78 Accepts]: Start accepts. Automaton has 3611 states and 7143 transitions. Word has length 171 [2024-11-09 04:33:25,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:25,155 INFO L471 AbstractCegarLoop]: Abstraction has 3611 states and 7143 transitions. [2024-11-09 04:33:25,155 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 04:33:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3611 states and 7143 transitions. [2024-11-09 04:33:25,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:25,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:25,157 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 04:33:25,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-09 04:33:25,157 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 04:33:25,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:25,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1146566297, now seen corresponding path program 37 times [2024-11-09 04:33:25,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:25,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185543611] [2024-11-09 04:33:25,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:25,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:25,503 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 04:33:25,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:25,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185543611] [2024-11-09 04:33:25,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185543611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:25,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:25,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:25,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031418361] [2024-11-09 04:33:25,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:25,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:25,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:25,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:25,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:25,505 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 04:33:26,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:26,789 INFO L93 Difference]: Finished difference Result 10393 states and 20771 transitions. [2024-11-09 04:33:26,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:26,789 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 04:33:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:26,836 INFO L225 Difference]: With dead ends: 10393 [2024-11-09 04:33:26,837 INFO L226 Difference]: Without dead ends: 7773 [2024-11-09 04:33:26,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-09 04:33:26,844 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 435 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:26,844 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.7s Time] [2024-11-09 04:33:26,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7773 states. [2024-11-09 04:33:26,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7773 to 3613. [2024-11-09 04:33:26,970 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 04:33:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3613 states to 3613 states and 7147 transitions. [2024-11-09 04:33:27,025 INFO L78 Accepts]: Start accepts. Automaton has 3613 states and 7147 transitions. Word has length 171 [2024-11-09 04:33:27,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:27,026 INFO L471 AbstractCegarLoop]: Abstraction has 3613 states and 7147 transitions. [2024-11-09 04:33:27,026 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 04:33:27,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3613 states and 7147 transitions. [2024-11-09 04:33:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:27,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:27,029 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 04:33:27,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-09 04:33:27,029 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 04:33:27,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:27,030 INFO L85 PathProgramCache]: Analyzing trace with hash -816107487, now seen corresponding path program 38 times [2024-11-09 04:33:27,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:27,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271709109] [2024-11-09 04:33:27,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:27,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:27,360 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 04:33:27,360 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:27,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271709109] [2024-11-09 04:33:27,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271709109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:27,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:27,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:27,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780218141] [2024-11-09 04:33:27,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:27,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:27,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:27,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:27,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:27,362 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 04:33:28,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:28,440 INFO L93 Difference]: Finished difference Result 9642 states and 19231 transitions. [2024-11-09 04:33:28,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:28,440 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 04:33:28,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:28,494 INFO L225 Difference]: With dead ends: 9642 [2024-11-09 04:33:28,494 INFO L226 Difference]: Without dead ends: 7022 [2024-11-09 04:33:28,501 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 04:33:28,501 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.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:28,502 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.7s Time] [2024-11-09 04:33:28,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7022 states. [2024-11-09 04:33:28,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7022 to 3608. [2024-11-09 04:33:28,832 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 04:33:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3608 states to 3608 states and 7137 transitions. [2024-11-09 04:33:28,881 INFO L78 Accepts]: Start accepts. Automaton has 3608 states and 7137 transitions. Word has length 171 [2024-11-09 04:33:28,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:28,882 INFO L471 AbstractCegarLoop]: Abstraction has 3608 states and 7137 transitions. [2024-11-09 04:33:28,882 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 04:33:28,882 INFO L276 IsEmpty]: Start isEmpty. Operand 3608 states and 7137 transitions. [2024-11-09 04:33:28,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:28,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:28,884 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 04:33:28,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-09 04:33:28,884 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 04:33:28,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:28,885 INFO L85 PathProgramCache]: Analyzing trace with hash -610597607, now seen corresponding path program 39 times [2024-11-09 04:33:28,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:28,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610217190] [2024-11-09 04:33:28,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:28,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:29,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 04:33:29,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:29,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610217190] [2024-11-09 04:33:29,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610217190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:29,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:29,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:29,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081659866] [2024-11-09 04:33:29,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:29,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:29,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:29,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:29,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:29,260 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 04:33:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:30,222 INFO L93 Difference]: Finished difference Result 11398 states and 22762 transitions. [2024-11-09 04:33:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:30,222 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 04:33:30,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:30,273 INFO L225 Difference]: With dead ends: 11398 [2024-11-09 04:33:30,273 INFO L226 Difference]: Without dead ends: 8778 [2024-11-09 04:33:30,280 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 04:33:30,280 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:30,280 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.6s Time] [2024-11-09 04:33:30,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8778 states. [2024-11-09 04:33:30,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8778 to 3614. [2024-11-09 04:33:30,397 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 04:33:30,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 7149 transitions. [2024-11-09 04:33:30,448 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 7149 transitions. Word has length 171 [2024-11-09 04:33:30,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:30,448 INFO L471 AbstractCegarLoop]: Abstraction has 3614 states and 7149 transitions. [2024-11-09 04:33:30,448 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 04:33:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 7149 transitions. [2024-11-09 04:33:30,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:30,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:30,450 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 04:33:30,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-09 04:33:30,450 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 04:33:30,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:30,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1721695905, now seen corresponding path program 40 times [2024-11-09 04:33:30,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:30,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067911888] [2024-11-09 04:33:30,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:30,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:30,849 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 04:33:30,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:30,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067911888] [2024-11-09 04:33:30,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067911888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:30,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:30,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:30,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105812740] [2024-11-09 04:33:30,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:30,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:30,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:30,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:30,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:30,851 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 04:33:31,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:31,891 INFO L93 Difference]: Finished difference Result 10630 states and 21188 transitions. [2024-11-09 04:33:31,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:31,892 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 04:33:31,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:31,945 INFO L225 Difference]: With dead ends: 10630 [2024-11-09 04:33:31,945 INFO L226 Difference]: Without dead ends: 8010 [2024-11-09 04:33:31,952 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 04:33:31,953 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 395 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:31,953 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.6s Time] [2024-11-09 04:33:31,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8010 states. [2024-11-09 04:33:32,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8010 to 3612. [2024-11-09 04:33:32,087 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 04:33:32,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3612 states to 3612 states and 7145 transitions. [2024-11-09 04:33:32,142 INFO L78 Accepts]: Start accepts. Automaton has 3612 states and 7145 transitions. Word has length 171 [2024-11-09 04:33:32,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:32,143 INFO L471 AbstractCegarLoop]: Abstraction has 3612 states and 7145 transitions. [2024-11-09 04:33:32,143 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 04:33:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3612 states and 7145 transitions. [2024-11-09 04:33:32,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:32,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:32,145 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 04:33:32,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-09 04:33:32,145 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 04:33:32,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:32,146 INFO L85 PathProgramCache]: Analyzing trace with hash -16854729, now seen corresponding path program 41 times [2024-11-09 04:33:32,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:32,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135016756] [2024-11-09 04:33:32,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:32,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:32,514 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 04:33:32,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:32,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135016756] [2024-11-09 04:33:32,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135016756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:32,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:32,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:32,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936768263] [2024-11-09 04:33:32,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:32,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:32,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:32,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:32,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:32,520 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 04:33:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:33,737 INFO L93 Difference]: Finished difference Result 10544 states and 21054 transitions. [2024-11-09 04:33:33,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:33,737 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 04:33:33,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:33,790 INFO L225 Difference]: With dead ends: 10544 [2024-11-09 04:33:33,790 INFO L226 Difference]: Without dead ends: 7924 [2024-11-09 04:33:33,797 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 04:33:33,797 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 04:33:33,798 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 04:33:33,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7924 states. [2024-11-09 04:33:33,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7924 to 3614. [2024-11-09 04:33:33,922 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 04:33:34,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 7149 transitions. [2024-11-09 04:33:34,112 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 7149 transitions. Word has length 171 [2024-11-09 04:33:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:34,113 INFO L471 AbstractCegarLoop]: Abstraction has 3614 states and 7149 transitions. [2024-11-09 04:33:34,113 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 04:33:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 7149 transitions. [2024-11-09 04:33:34,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:34,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:34,116 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 04:33:34,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-09 04:33:34,117 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 04:33:34,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:34,118 INFO L85 PathProgramCache]: Analyzing trace with hash 2074964035, now seen corresponding path program 42 times [2024-11-09 04:33:34,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:34,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090991222] [2024-11-09 04:33:34,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:34,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:34,603 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 04:33:34,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:34,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090991222] [2024-11-09 04:33:34,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090991222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:34,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:34,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:34,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288225894] [2024-11-09 04:33:34,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:34,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:34,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:34,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:34,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:34,605 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 04:33:35,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:35,711 INFO L93 Difference]: Finished difference Result 9660 states and 19286 transitions. [2024-11-09 04:33:35,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:35,711 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 04:33:35,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:35,774 INFO L225 Difference]: With dead ends: 9660 [2024-11-09 04:33:35,774 INFO L226 Difference]: Without dead ends: 7040 [2024-11-09 04:33:35,782 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 04:33:35,783 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 04:33:35,783 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 04:33:35,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7040 states. [2024-11-09 04:33:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7040 to 3602. [2024-11-09 04:33:35,965 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 04:33:35,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3602 states to 3602 states and 7125 transitions. [2024-11-09 04:33:36,033 INFO L78 Accepts]: Start accepts. Automaton has 3602 states and 7125 transitions. Word has length 171 [2024-11-09 04:33:36,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:36,034 INFO L471 AbstractCegarLoop]: Abstraction has 3602 states and 7125 transitions. [2024-11-09 04:33:36,034 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 04:33:36,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3602 states and 7125 transitions. [2024-11-09 04:33:36,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:36,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:36,037 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 04:33:36,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-09 04:33:36,038 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 04:33:36,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:36,038 INFO L85 PathProgramCache]: Analyzing trace with hash 314428847, now seen corresponding path program 43 times [2024-11-09 04:33:36,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:36,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932627018] [2024-11-09 04:33:36,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:36,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:36,593 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 04:33:36,593 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:36,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932627018] [2024-11-09 04:33:36,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932627018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:36,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:36,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:36,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714612091] [2024-11-09 04:33:36,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:36,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:36,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:36,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:36,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:36,596 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 04:33:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:37,637 INFO L93 Difference]: Finished difference Result 9263 states and 18530 transitions. [2024-11-09 04:33:37,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:37,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 04:33:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:37,704 INFO L225 Difference]: With dead ends: 9263 [2024-11-09 04:33:37,704 INFO L226 Difference]: Without dead ends: 6643 [2024-11-09 04:33:37,714 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 04:33:37,715 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 393 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:37,715 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.6s Time] [2024-11-09 04:33:37,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6643 states. [2024-11-09 04:33:37,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6643 to 3611. [2024-11-09 04:33:37,855 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 04:33:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3611 states to 3611 states and 7143 transitions. [2024-11-09 04:33:37,945 INFO L78 Accepts]: Start accepts. Automaton has 3611 states and 7143 transitions. Word has length 171 [2024-11-09 04:33:37,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:37,946 INFO L471 AbstractCegarLoop]: Abstraction has 3611 states and 7143 transitions. [2024-11-09 04:33:37,946 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 04:33:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3611 states and 7143 transitions. [2024-11-09 04:33:37,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:37,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:37,948 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 04:33:37,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-09 04:33:37,948 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 04:33:37,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash -441769229, now seen corresponding path program 44 times [2024-11-09 04:33:37,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:37,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323970781] [2024-11-09 04:33:37,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:37,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:38,296 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 04:33:38,296 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:38,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323970781] [2024-11-09 04:33:38,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323970781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:38,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:38,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:38,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075751157] [2024-11-09 04:33:38,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:38,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:38,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:38,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:38,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:38,298 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 04:33:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:39,456 INFO L93 Difference]: Finished difference Result 10108 states and 20201 transitions. [2024-11-09 04:33:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:39,457 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 04:33:39,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:39,516 INFO L225 Difference]: With dead ends: 10108 [2024-11-09 04:33:39,516 INFO L226 Difference]: Without dead ends: 7488 [2024-11-09 04:33:39,525 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 04:33:39,526 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 04:33:39,526 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 04:33:39,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7488 states. [2024-11-09 04:33:39,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7488 to 3613. [2024-11-09 04:33:39,709 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 04:33:39,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3613 states to 3613 states and 7147 transitions. [2024-11-09 04:33:39,775 INFO L78 Accepts]: Start accepts. Automaton has 3613 states and 7147 transitions. Word has length 171 [2024-11-09 04:33:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:39,775 INFO L471 AbstractCegarLoop]: Abstraction has 3613 states and 7147 transitions. [2024-11-09 04:33:39,775 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 04:33:39,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3613 states and 7147 transitions. [2024-11-09 04:33:39,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:39,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:39,777 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 04:33:39,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-09 04:33:39,777 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 04:33:39,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:39,778 INFO L85 PathProgramCache]: Analyzing trace with hash 600404979, now seen corresponding path program 45 times [2024-11-09 04:33:39,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:39,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600178316] [2024-11-09 04:33:39,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:39,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:40,069 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 04:33:40,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:40,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600178316] [2024-11-09 04:33:40,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600178316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:40,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:40,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:40,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595509071] [2024-11-09 04:33:40,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:40,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:40,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:40,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:40,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:40,071 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 04:33:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:41,027 INFO L93 Difference]: Finished difference Result 9319 states and 18623 transitions. [2024-11-09 04:33:41,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:41,027 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 04:33:41,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:41,090 INFO L225 Difference]: With dead ends: 9319 [2024-11-09 04:33:41,090 INFO L226 Difference]: Without dead ends: 6699 [2024-11-09 04:33:41,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-11-09 04:33:41,099 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:41,100 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.6s Time] [2024-11-09 04:33:41,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6699 states. [2024-11-09 04:33:41,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6699 to 3608. [2024-11-09 04:33:41,411 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 04:33:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3608 states to 3608 states and 7137 transitions. [2024-11-09 04:33:41,470 INFO L78 Accepts]: Start accepts. Automaton has 3608 states and 7137 transitions. Word has length 171 [2024-11-09 04:33:41,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:41,471 INFO L471 AbstractCegarLoop]: Abstraction has 3608 states and 7137 transitions. [2024-11-09 04:33:41,471 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 04:33:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3608 states and 7137 transitions. [2024-11-09 04:33:41,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:41,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:41,473 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 04:33:41,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-09 04:33:41,473 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 04:33:41,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1928086955, now seen corresponding path program 46 times [2024-11-09 04:33:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:41,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864016252] [2024-11-09 04:33:41,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:41,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:41,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 04:33:41,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:41,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864016252] [2024-11-09 04:33:41,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864016252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:41,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:41,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:41,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653379223] [2024-11-09 04:33:41,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:41,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:41,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:41,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:41,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:41,936 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 04:33:43,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:43,076 INFO L93 Difference]: Finished difference Result 9517 states and 19000 transitions. [2024-11-09 04:33:43,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:43,076 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 04:33:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:43,144 INFO L225 Difference]: With dead ends: 9517 [2024-11-09 04:33:43,144 INFO L226 Difference]: Without dead ends: 6897 [2024-11-09 04:33:43,153 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 04:33:43,153 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 381 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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 04:33:43,153 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 04:33:43,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6897 states. [2024-11-09 04:33:43,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6897 to 3614. [2024-11-09 04:33:43,325 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 04:33:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 7149 transitions. [2024-11-09 04:33:43,388 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 7149 transitions. Word has length 171 [2024-11-09 04:33:43,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:43,389 INFO L471 AbstractCegarLoop]: Abstraction has 3614 states and 7149 transitions. [2024-11-09 04:33:43,389 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 04:33:43,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 7149 transitions. [2024-11-09 04:33:43,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:43,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:43,391 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 04:33:43,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-09 04:33:43,392 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 04:33:43,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:43,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1324706133, now seen corresponding path program 47 times [2024-11-09 04:33:43,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:43,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834628887] [2024-11-09 04:33:43,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:43,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:43,731 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 04:33:43,731 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:43,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834628887] [2024-11-09 04:33:43,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834628887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:43,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:43,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:43,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303881251] [2024-11-09 04:33:43,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:43,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:43,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:43,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:43,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:43,733 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 04:33:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:44,848 INFO L93 Difference]: Finished difference Result 9583 states and 19113 transitions. [2024-11-09 04:33:44,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:44,848 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 04:33:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:44,907 INFO L225 Difference]: With dead ends: 9583 [2024-11-09 04:33:44,907 INFO L226 Difference]: Without dead ends: 6963 [2024-11-09 04:33:44,913 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 04:33:44,913 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 04:33:44,913 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 04:33:44,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6963 states. [2024-11-09 04:33:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6963 to 3612. [2024-11-09 04:33:45,215 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 04:33:45,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3612 states to 3612 states and 7145 transitions. [2024-11-09 04:33:45,271 INFO L78 Accepts]: Start accepts. Automaton has 3612 states and 7145 transitions. Word has length 171 [2024-11-09 04:33:45,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:45,271 INFO L471 AbstractCegarLoop]: Abstraction has 3612 states and 7145 transitions. [2024-11-09 04:33:45,271 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 04:33:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3612 states and 7145 transitions. [2024-11-09 04:33:45,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:45,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:45,273 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 04:33:45,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-09 04:33:45,274 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 04:33:45,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:45,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1550724065, now seen corresponding path program 48 times [2024-11-09 04:33:45,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:45,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469986714] [2024-11-09 04:33:45,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:45,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:45,577 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 04:33:45,577 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:45,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469986714] [2024-11-09 04:33:45,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469986714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:45,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:45,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:45,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162639363] [2024-11-09 04:33:45,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:45,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:45,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:45,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:45,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:45,579 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 04:33:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:46,397 INFO L93 Difference]: Finished difference Result 9470 states and 18906 transitions. [2024-11-09 04:33:46,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:46,398 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 04:33:46,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:46,453 INFO L225 Difference]: With dead ends: 9470 [2024-11-09 04:33:46,454 INFO L226 Difference]: Without dead ends: 6850 [2024-11-09 04:33:46,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-09 04:33:46,460 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 437 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:46,460 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.4s Time] [2024-11-09 04:33:46,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6850 states. [2024-11-09 04:33:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6850 to 3614. [2024-11-09 04:33:46,594 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 04:33:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 7149 transitions. [2024-11-09 04:33:46,655 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 7149 transitions. Word has length 171 [2024-11-09 04:33:46,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:46,655 INFO L471 AbstractCegarLoop]: Abstraction has 3614 states and 7149 transitions. [2024-11-09 04:33:46,655 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 04:33:46,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 7149 transitions. [2024-11-09 04:33:46,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 04:33:46,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:46,657 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 04:33:46,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-09 04:33:46,657 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 04:33:46,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:46,658 INFO L85 PathProgramCache]: Analyzing trace with hash -411949719, now seen corresponding path program 49 times [2024-11-09 04:33:46,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:46,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088528073] [2024-11-09 04:33:46,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:46,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:47,313 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 04:33:47,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:47,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088528073] [2024-11-09 04:33:47,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088528073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:47,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:47,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:33:47,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736525054] [2024-11-09 04:33:47,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:47,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:33:47,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:47,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:33:47,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:47,317 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 04:33:48,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:48,478 INFO L93 Difference]: Finished difference Result 8546 states and 17058 transitions. [2024-11-09 04:33:48,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:48,479 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 04:33:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:48,555 INFO L225 Difference]: With dead ends: 8546 [2024-11-09 04:33:48,555 INFO L226 Difference]: Without dead ends: 5926 [2024-11-09 04:33:48,562 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 04:33:48,563 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:48,563 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.5s Time] [2024-11-09 04:33:48,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2024-11-09 04:33:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 3593. [2024-11-09 04:33:48,781 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 04:33:48,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 7107 transitions. [2024-11-09 04:33:48,863 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 7107 transitions. Word has length 171 [2024-11-09 04:33:48,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:48,864 INFO L471 AbstractCegarLoop]: Abstraction has 3593 states and 7107 transitions. [2024-11-09 04:33:48,864 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 04:33:48,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 7107 transitions. [2024-11-09 04:33:48,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-09 04:33:48,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:48,867 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 04:33:48,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-11-09 04:33:48,868 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 04:33:48,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:48,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1527232445, now seen corresponding path program 1 times [2024-11-09 04:33:48,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:48,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27838504] [2024-11-09 04:33:48,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:48,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:49,026 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 04:33:49,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:49,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27838504] [2024-11-09 04:33:49,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27838504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:33:49,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881508180] [2024-11-09 04:33:49,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:49,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:33:49,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:33:49,031 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:33:49,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 04:33:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:49,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 04:33:49,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:33:49,432 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 04:33:49,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:33:49,539 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 04:33:49,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881508180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:33:49,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1793309969] [2024-11-09 04:33:49,543 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 04:33:49,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:33:49,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 04:33:49,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280300725] [2024-11-09 04:33:49,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:33:49,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 04:33:49,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:49,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 04:33:49,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:33:49,551 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 04:33:50,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:50,122 INFO L93 Difference]: Finished difference Result 8067 states and 16232 transitions. [2024-11-09 04:33:50,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:50,122 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 04:33:50,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:50,203 INFO L225 Difference]: With dead ends: 8067 [2024-11-09 04:33:50,204 INFO L226 Difference]: Without dead ends: 7085 [2024-11-09 04:33:50,208 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 04:33:50,209 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 04:33:50,209 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 04:33:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2024-11-09 04:33:50,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 6919. [2024-11-09 04:33:50,634 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 04:33:50,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6919 states to 6919 states and 13953 transitions. [2024-11-09 04:33:50,712 INFO L78 Accepts]: Start accepts. Automaton has 6919 states and 13953 transitions. Word has length 178 [2024-11-09 04:33:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:50,713 INFO L471 AbstractCegarLoop]: Abstraction has 6919 states and 13953 transitions. [2024-11-09 04:33:50,713 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 04:33:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 6919 states and 13953 transitions. [2024-11-09 04:33:50,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 04:33:50,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:50,717 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 04:33:50,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 04:33:50,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:33:50,918 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 04:33:50,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:50,918 INFO L85 PathProgramCache]: Analyzing trace with hash -383826395, now seen corresponding path program 1 times [2024-11-09 04:33:50,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:33:50,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058382540] [2024-11-09 04:33:50,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:50,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:52,871 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 04:33:52,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:52,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058382540] [2024-11-09 04:33:52,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058382540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:33:52,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548868815] [2024-11-09 04:33:52,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:52,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:33:52,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:33:52,875 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:33:52,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 04:33:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:53,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 04:33:53,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:33:54,538 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 04:33:54,597 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 04:33:54,695 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 04:33:54,792 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 04:33:55,406 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 04:33:55,476 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 04:33:55,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:33:57,640 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 04:33:57,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548868815] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:33:57,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1784029258] [2024-11-09 04:33:57,646 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 04:33:57,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:33:57,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 41 [2024-11-09 04:33:57,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158217946] [2024-11-09 04:33:57,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:33:57,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-09 04:33:57,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:57,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-09 04:33:57,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1478, Unknown=0, NotChecked=0, Total=1722 [2024-11-09 04:33:57,654 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 04:34:08,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:34:08,389 INFO L93 Difference]: Finished difference Result 17143 states and 34453 transitions. [2024-11-09 04:34:08,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-09 04:34:08,390 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 04:34:08,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:34:08,490 INFO L225 Difference]: With dead ends: 17143 [2024-11-09 04:34:08,491 INFO L226 Difference]: Without dead ends: 16833 [2024-11-09 04:34:08,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2194 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1171, Invalid=6311, Unknown=0, NotChecked=0, Total=7482 [2024-11-09 04:34:08,499 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 1500 mSDsluCounter, 3397 mSDsCounter, 0 mSdLazyCounter, 5474 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 3688 SdHoareTripleChecker+Invalid, 5539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 5474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:34:08,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 3688 Invalid, 5539 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 5474 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-09 04:34:08,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16833 states. [2024-11-09 04:34:08,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16833 to 7232. [2024-11-09 04:34:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7232 states, 7219 states have (on average 2.0171768943066906) internal successors, (14562), 7231 states have internal predecessors, (14562), 0 states have call successors, (0), 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 04:34:08,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7232 states to 7232 states and 14562 transitions. [2024-11-09 04:34:09,038 INFO L78 Accepts]: Start accepts. Automaton has 7232 states and 14562 transitions. Word has length 202 [2024-11-09 04:34:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:34:09,038 INFO L471 AbstractCegarLoop]: Abstraction has 7232 states and 14562 transitions. [2024-11-09 04:34:09,039 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 04:34:09,039 INFO L276 IsEmpty]: Start isEmpty. Operand 7232 states and 14562 transitions. [2024-11-09 04:34:09,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 04:34:09,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:34:09,044 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 04:34:09,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 04:34:09,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:34:09,245 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 04:34:09,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:34:09,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1524873095, now seen corresponding path program 2 times [2024-11-09 04:34:09,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:34:09,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818821570] [2024-11-09 04:34:09,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:34:09,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:34:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:34:10,469 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 04:34:10,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:34:10,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818821570] [2024-11-09 04:34:10,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818821570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:34:10,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595848700] [2024-11-09 04:34:10,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:34:10,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:34:10,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:34:10,472 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:34:10,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 04:34:10,805 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 04:34:10,806 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:34:10,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 04:34:10,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:34:12,084 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 04:34:12,167 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 04:34:12,257 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 04:34:12,637 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 04:34:13,078 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 04:34:13,154 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 04:34:13,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:34:15,220 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 04:34:15,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595848700] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:34:15,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [820567044] [2024-11-09 04:34:15,223 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 04:34:15,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:34:15,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2024-11-09 04:34:15,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881826925] [2024-11-09 04:34:15,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:34:15,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-09 04:34:15,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:34:15,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 04:34:15,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1421, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 04:34:15,228 INFO L87 Difference]: Start difference. First operand 7232 states and 14562 transitions. Second operand has 41 states, 40 states have (on average 8.875) internal successors, (355), 41 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 04:34:26,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:34:26,551 INFO L93 Difference]: Finished difference Result 17720 states and 35609 transitions. [2024-11-09 04:34:26,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-09 04:34:26,552 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 8.875) internal successors, (355), 41 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 04:34:26,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:34:26,641 INFO L225 Difference]: With dead ends: 17720 [2024-11-09 04:34:26,641 INFO L226 Difference]: Without dead ends: 17407 [2024-11-09 04:34:26,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1990 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1058, Invalid=5748, Unknown=0, NotChecked=0, Total=6806 [2024-11-09 04:34:26,649 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 1520 mSDsluCounter, 3538 mSDsCounter, 0 mSdLazyCounter, 4835 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 3823 SdHoareTripleChecker+Invalid, 4961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 4835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:34:26,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 3823 Invalid, 4961 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [126 Valid, 4835 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-09 04:34:26,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17407 states. [2024-11-09 04:34:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17407 to 7237. [2024-11-09 04:34:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7237 states, 7224 states have (on average 2.0171650055370987) internal successors, (14572), 7236 states have internal predecessors, (14572), 0 states have call successors, (0), 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 04:34:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7237 states to 7237 states and 14572 transitions. [2024-11-09 04:34:27,098 INFO L78 Accepts]: Start accepts. Automaton has 7237 states and 14572 transitions. Word has length 202 [2024-11-09 04:34:27,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:34:27,099 INFO L471 AbstractCegarLoop]: Abstraction has 7237 states and 14572 transitions. [2024-11-09 04:34:27,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 8.875) internal successors, (355), 41 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 04:34:27,099 INFO L276 IsEmpty]: Start isEmpty. Operand 7237 states and 14572 transitions. [2024-11-09 04:34:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 04:34:27,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:34:27,105 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 04:34:27,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 04:34:27,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2024-11-09 04:34:27,305 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 04:34:27,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:34:27,306 INFO L85 PathProgramCache]: Analyzing trace with hash -353747573, now seen corresponding path program 3 times [2024-11-09 04:34:27,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:34:27,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370894308] [2024-11-09 04:34:27,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:34:27,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:34:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:34:28,715 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 04:34:28,715 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:34:28,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370894308] [2024-11-09 04:34:28,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370894308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:34:28,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480101689] [2024-11-09 04:34:28,716 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 04:34:28,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:34:28,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:34:28,717 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:34:28,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 04:34:29,442 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 04:34:29,442 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:34:29,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 04:34:29,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:34:29,804 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 04:34:29,841 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 04:34:29,901 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 04:34:30,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:34:30,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:34:30,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:34:30,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:34:30,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2024-11-09 04:34:30,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:34:30,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:34:30,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:34:30,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:34:30,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:34:30,380 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 6 case distinctions, treesize of input 46 treesize of output 54 [2024-11-09 04:34:30,479 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 04:34:30,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:35:22,793 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse1 (select .cse0 |c_~#cache~0.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (or (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| .cse2))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| .cse2) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| .cse2) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))))))) is different from false [2024-11-09 04:35:24,852 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse1 (select .cse0 |c_~#cache~0.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (or (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| .cse2))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| .cse2) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| .cse2) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))))))) is different from false [2024-11-09 04:35:25,372 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 04:35:25,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480101689] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:35:25,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1309729369] [2024-11-09 04:35:25,373 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 04:35:25,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:35:25,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 36 [2024-11-09 04:35:25,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694948341] [2024-11-09 04:35:25,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:35:25,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 04:35:25,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:35:25,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 04:35:25,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1006, Unknown=30, NotChecked=134, Total=1332 [2024-11-09 04:35:25,378 INFO L87 Difference]: Start difference. First operand 7237 states and 14572 transitions. Second operand has 37 states, 36 states have (on average 7.138888888888889) internal successors, (257), 37 states have internal predecessors, (257), 0 states have call successors, (0), 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 04:35:38,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:35:38,809 INFO L93 Difference]: Finished difference Result 16476 states and 33251 transitions. [2024-11-09 04:35:38,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-09 04:35:38,810 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 7.138888888888889) internal successors, (257), 37 states have internal predecessors, (257), 0 states have call successors, (0), 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 04:35:38,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:35:38,890 INFO L225 Difference]: With dead ends: 16476 [2024-11-09 04:35:38,891 INFO L226 Difference]: Without dead ends: 16432 [2024-11-09 04:35:38,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 384 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 61.0s TimeCoverageRelationStatistics Valid=892, Invalid=3749, Unknown=59, NotChecked=270, Total=4970 [2024-11-09 04:35:38,897 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 1392 mSDsluCounter, 3805 mSDsCounter, 0 mSdLazyCounter, 3705 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 4188 SdHoareTripleChecker+Invalid, 5638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 3705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1812 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:35:38,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 4188 Invalid, 5638 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [121 Valid, 3705 Invalid, 0 Unknown, 1812 Unchecked, 6.3s Time] [2024-11-09 04:35:38,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16432 states. [2024-11-09 04:35:39,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16432 to 7267. [2024-11-09 04:35:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7267 states, 7254 states have (on average 2.017645437000276) internal successors, (14636), 7266 states have internal predecessors, (14636), 0 states have call successors, (0), 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 04:35:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7267 states to 7267 states and 14636 transitions. [2024-11-09 04:35:39,404 INFO L78 Accepts]: Start accepts. Automaton has 7267 states and 14636 transitions. Word has length 202 [2024-11-09 04:35:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:35:39,405 INFO L471 AbstractCegarLoop]: Abstraction has 7267 states and 14636 transitions. [2024-11-09 04:35:39,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 7.138888888888889) internal successors, (257), 37 states have internal predecessors, (257), 0 states have call successors, (0), 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 04:35:39,405 INFO L276 IsEmpty]: Start isEmpty. Operand 7267 states and 14636 transitions. [2024-11-09 04:35:39,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 04:35:39,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:35:39,408 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 04:35:39,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 04:35:39,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2024-11-09 04:35:39,609 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 04:35:39,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:35:39,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1808543515, now seen corresponding path program 4 times [2024-11-09 04:35:39,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:35:39,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862831618] [2024-11-09 04:35:39,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:39,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:35:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:40,567 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 04:35:40,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:35:40,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862831618] [2024-11-09 04:35:40,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862831618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:35:40,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313672777] [2024-11-09 04:35:40,568 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 04:35:40,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:35:40,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:35:40,569 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:35:40,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 04:35:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:40,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 04:35:40,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:35:42,091 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 04:35:42,167 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 04:35:42,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:42,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:42,705 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 04:35:42,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:42,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:42,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:42,839 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 04:35:42,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:42,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:42,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:42,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:35:42,965 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 04:35:43,064 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 04:35:43,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:36:23,359 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse1 |c_~#cache~0.base| (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (= (select (select (store .cse1 |c_~#cache~0.base| (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0))))))) is different from false [2024-11-09 04:36:23,843 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 04:36:23,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313672777] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:36:23,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [825832943] [2024-11-09 04:36:23,844 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 04:36:23,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:36:23,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 38 [2024-11-09 04:36:23,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299650908] [2024-11-09 04:36:23,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:36:23,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 04:36:23,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:36:23,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 04:36:23,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1225, Unknown=19, NotChecked=72, Total=1482 [2024-11-09 04:36:23,848 INFO L87 Difference]: Start difference. First operand 7267 states and 14636 transitions. Second operand has 39 states, 38 states have (on average 9.289473684210526) internal successors, (353), 39 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:36:33,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:36:33,717 INFO L93 Difference]: Finished difference Result 16598 states and 33503 transitions. [2024-11-09 04:36:33,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-09 04:36:33,717 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 9.289473684210526) internal successors, (353), 39 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:36:33,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:36:33,802 INFO L225 Difference]: With dead ends: 16598 [2024-11-09 04:36:33,802 INFO L226 Difference]: Without dead ends: 16554 [2024-11-09 04:36:33,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 382 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1894 ImplicationChecksByTransitivity, 44.2s TimeCoverageRelationStatistics Valid=1387, Invalid=5908, Unknown=19, NotChecked=168, Total=7482 [2024-11-09 04:36:33,810 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 1904 mSDsluCounter, 2940 mSDsCounter, 0 mSdLazyCounter, 4255 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1904 SdHoareTripleChecker+Valid, 3232 SdHoareTripleChecker+Invalid, 5418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 4255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1024 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:36:33,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1904 Valid, 3232 Invalid, 5418 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [139 Valid, 4255 Invalid, 0 Unknown, 1024 Unchecked, 5.9s Time] [2024-11-09 04:36:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16554 states. [2024-11-09 04:36:34,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16554 to 7306. [2024-11-09 04:36:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7306 states, 7293 states have (on average 2.018099547511312) internal successors, (14718), 7305 states have internal predecessors, (14718), 0 states have call successors, (0), 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 04:36:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7306 states to 7306 states and 14718 transitions. [2024-11-09 04:36:34,249 INFO L78 Accepts]: Start accepts. Automaton has 7306 states and 14718 transitions. Word has length 202 [2024-11-09 04:36:34,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:36:34,249 INFO L471 AbstractCegarLoop]: Abstraction has 7306 states and 14718 transitions. [2024-11-09 04:36:34,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 9.289473684210526) internal successors, (353), 39 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:36:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 7306 states and 14718 transitions. [2024-11-09 04:36:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 04:36:34,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:36:34,253 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 04:36:34,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 04:36:34,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2024-11-09 04:36:34,454 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 04:36:34,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:36:34,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1427350239, now seen corresponding path program 5 times [2024-11-09 04:36:34,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:36:34,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958470186] [2024-11-09 04:36:34,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:36:34,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:36:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:36:35,684 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 04:36:35,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:36:35,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958470186] [2024-11-09 04:36:35,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958470186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:36:35,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833056286] [2024-11-09 04:36:35,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:36:35,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:36:35,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:36:35,687 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:36:35,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 04:36:36,001 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 04:36:36,001 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:36:36,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 04:36:36,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:36:37,339 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 04:36:37,560 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 04:36:37,888 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 04:36:37,962 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 04:36:38,048 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 04:36:38,135 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 04:36:38,136 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:36:39,535 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 04:36:39,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833056286] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:36:39,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [773726981] [2024-11-09 04:36:39,537 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 04:36:39,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:36:39,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 39 [2024-11-09 04:36:39,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528332834] [2024-11-09 04:36:39,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:36:39,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-09 04:36:39,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:36:39,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 04:36:39,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1382, Unknown=0, NotChecked=0, Total=1560 [2024-11-09 04:36:39,542 INFO L87 Difference]: Start difference. First operand 7306 states and 14718 transitions. Second operand has 40 states, 39 states have (on average 9.051282051282051) internal successors, (353), 40 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:36:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:36:57,809 INFO L93 Difference]: Finished difference Result 18221 states and 36635 transitions. [2024-11-09 04:36:57,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-11-09 04:36:57,809 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 9.051282051282051) internal successors, (353), 40 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:36:57,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:36:57,904 INFO L225 Difference]: With dead ends: 18221 [2024-11-09 04:36:57,904 INFO L226 Difference]: Without dead ends: 17892 [2024-11-09 04:36:57,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4619 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=2123, Invalid=11919, Unknown=0, NotChecked=0, Total=14042 [2024-11-09 04:36:57,914 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 1703 mSDsluCounter, 4816 mSDsCounter, 0 mSdLazyCounter, 7752 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1703 SdHoareTripleChecker+Valid, 5144 SdHoareTripleChecker+Invalid, 7892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 7752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:36:57,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1703 Valid, 5144 Invalid, 7892 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [140 Valid, 7752 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2024-11-09 04:36:57,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17892 states. [2024-11-09 04:36:58,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17892 to 7418. [2024-11-09 04:36:58,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7418 states, 7405 states have (on average 2.0183659689399054) internal successors, (14946), 7417 states have internal predecessors, (14946), 0 states have call successors, (0), 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 04:36:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7418 states to 7418 states and 14946 transitions. [2024-11-09 04:36:58,558 INFO L78 Accepts]: Start accepts. Automaton has 7418 states and 14946 transitions. Word has length 202 [2024-11-09 04:36:58,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:36:58,559 INFO L471 AbstractCegarLoop]: Abstraction has 7418 states and 14946 transitions. [2024-11-09 04:36:58,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 9.051282051282051) internal successors, (353), 40 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:36:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 7418 states and 14946 transitions. [2024-11-09 04:36:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 04:36:58,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:36:58,563 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 04:36:58,584 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 04:36:58,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:36:58,764 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 04:36:58,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:36:58,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1521730997, now seen corresponding path program 6 times [2024-11-09 04:36:58,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:36:58,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130386002] [2024-11-09 04:36:58,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:36:58,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:36:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:36:59,740 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 04:36:59,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:36:59,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130386002] [2024-11-09 04:36:59,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130386002] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:36:59,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27872268] [2024-11-09 04:36:59,741 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 04:36:59,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:36:59,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:36:59,744 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:36:59,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 04:37:00,087 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 04:37:00,087 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:37:00,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 04:37:00,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:37:00,103 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 13 treesize of output 9 [2024-11-09 04:37:00,164 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 04:37:00,267 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-09 04:37:00,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 04:37:00,372 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 04:37:00,372 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 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 04:37:00,638 INFO L349 Elim1Store]: treesize reduction 60, result has 43.9 percent of original size [2024-11-09 04:37:00,638 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 5 case distinctions, treesize of input 46 treesize of output 83 [2024-11-09 04:37:00,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:00,847 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 04:37:00,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:37:00,871 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 04:37:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 04:37:00,889 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:37:00,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27872268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:37:00,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:37:00,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 18 [2024-11-09 04:37:00,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411097341] [2024-11-09 04:37:00,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:37:00,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:37:00,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:37:00,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:37:00,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-09 04:37:00,892 INFO L87 Difference]: Start difference. First operand 7418 states and 14946 transitions. Second operand has 9 states, 8 states have (on average 18.5) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 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 04:37:03,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:37:03,638 INFO L93 Difference]: Finished difference Result 11203 states and 22640 transitions. [2024-11-09 04:37:03,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 04:37:03,639 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 18.5) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 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 04:37:03,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:37:03,725 INFO L225 Difference]: With dead ends: 11203 [2024-11-09 04:37:03,726 INFO L226 Difference]: Without dead ends: 11164 [2024-11-09 04:37:03,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=852, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 04:37:03,731 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 283 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:37:03,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1899 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 04:37:03,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11164 states. [2024-11-09 04:37:04,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11164 to 7862. [2024-11-09 04:37:04,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7862 states, 7849 states have (on average 2.0265001911071474) internal successors, (15906), 7861 states have internal predecessors, (15906), 0 states have call successors, (0), 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 04:37:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7862 states to 7862 states and 15906 transitions. [2024-11-09 04:37:04,346 INFO L78 Accepts]: Start accepts. Automaton has 7862 states and 15906 transitions. Word has length 202 [2024-11-09 04:37:04,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:37:04,346 INFO L471 AbstractCegarLoop]: Abstraction has 7862 states and 15906 transitions. [2024-11-09 04:37:04,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 18.5) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 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 04:37:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand 7862 states and 15906 transitions. [2024-11-09 04:37:04,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 04:37:04,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:37:04,350 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 04:37:04,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 04:37:04,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2024-11-09 04:37:04,551 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 04:37:04,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:37:04,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1689752237, now seen corresponding path program 7 times [2024-11-09 04:37:04,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:37:04,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714769528] [2024-11-09 04:37:04,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:37:04,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:37:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:37:05,663 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 04:37:05,663 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:37:05,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714769528] [2024-11-09 04:37:05,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714769528] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:37:05,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750989] [2024-11-09 04:37:05,663 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 04:37:05,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:37:05,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:37:05,665 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:37:05,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 04:37:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:37:06,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 04:37:06,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:37:07,471 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 04:37:07,922 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 04:37:08,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:08,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:08,003 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 04:37:08,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:08,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:08,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:08,119 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 04:37:08,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:08,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:08,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:08,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:08,236 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 04:37:08,346 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 04:37:08,346 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:37:13,819 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse2 (+ (* |c_t_funThread1of1ForFork0_#t~post35#1| 28) 28 |c_~#cache~0.offset|)) (.cse1 (select .cse0 |c_~#cache~0.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int)) (or (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| .cse2))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| .cse2) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))))))) is different from false [2024-11-09 04:37:15,852 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int)) (or (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| .cse3))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int)) (or (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| .cse3))))))) is different from false [2024-11-09 04:37:16,286 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 04:37:16,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750989] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:37:16,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1825530616] [2024-11-09 04:37:16,288 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 04:37:16,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:37:16,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 38 [2024-11-09 04:37:16,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343026978] [2024-11-09 04:37:16,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:37:16,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 04:37:16,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:37:16,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 04:37:16,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1190, Unknown=2, NotChecked=142, Total=1482 [2024-11-09 04:37:16,291 INFO L87 Difference]: Start difference. First operand 7862 states and 15906 transitions. Second operand has 39 states, 38 states have (on average 9.289473684210526) internal successors, (353), 39 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:37:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:37:30,607 INFO L93 Difference]: Finished difference Result 17567 states and 35529 transitions. [2024-11-09 04:37:30,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-09 04:37:30,608 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 9.289473684210526) internal successors, (353), 39 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:37:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:37:30,719 INFO L225 Difference]: With dead ends: 17567 [2024-11-09 04:37:30,719 INFO L226 Difference]: Without dead ends: 17523 [2024-11-09 04:37:30,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 382 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2228 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=1499, Invalid=6697, Unknown=2, NotChecked=358, Total=8556 [2024-11-09 04:37:30,730 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 1639 mSDsluCounter, 4230 mSDsCounter, 0 mSdLazyCounter, 6690 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1639 SdHoareTripleChecker+Valid, 4552 SdHoareTripleChecker+Invalid, 9038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 6690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2193 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:37:30,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1639 Valid, 4552 Invalid, 9038 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [155 Valid, 6690 Invalid, 0 Unknown, 2193 Unchecked, 9.5s Time] [2024-11-09 04:37:30,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17523 states. [2024-11-09 04:37:31,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17523 to 7797. [2024-11-09 04:37:31,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7797 states, 7784 states have (on average 2.02672147995889) internal successors, (15776), 7796 states have internal predecessors, (15776), 0 states have call successors, (0), 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 04:37:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7797 states to 7797 states and 15776 transitions. [2024-11-09 04:37:31,486 INFO L78 Accepts]: Start accepts. Automaton has 7797 states and 15776 transitions. Word has length 202 [2024-11-09 04:37:31,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:37:31,486 INFO L471 AbstractCegarLoop]: Abstraction has 7797 states and 15776 transitions. [2024-11-09 04:37:31,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 9.289473684210526) internal successors, (353), 39 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:37:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 7797 states and 15776 transitions. [2024-11-09 04:37:31,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 04:37:31,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:37:31,491 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 04:37:31,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-09 04:37:31,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2024-11-09 04:37:31,692 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 04:37:31,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:37:31,693 INFO L85 PathProgramCache]: Analyzing trace with hash -472746243, now seen corresponding path program 8 times [2024-11-09 04:37:31,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:37:31,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124548707] [2024-11-09 04:37:31,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:37:31,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:37:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:37:33,241 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 04:37:33,241 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:37:33,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124548707] [2024-11-09 04:37:33,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124548707] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:37:33,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477169370] [2024-11-09 04:37:33,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:37:33,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:37:33,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:37:33,243 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:37:33,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 04:37:33,602 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 04:37:33,602 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:37:33,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 04:37:33,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:37:34,691 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 04:37:34,781 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 04:37:35,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:35,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:35,149 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 04:37:35,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:35,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:35,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:35,254 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 04:37:35,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:35,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:35,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:35,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:37:35,516 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 04:37:35,632 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 04:37:35,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:37:47,509 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 04:37:47,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477169370] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:37:47,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1742417683] [2024-11-09 04:37:47,511 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 04:37:47,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:37:47,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 38 [2024-11-09 04:37:47,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905345749] [2024-11-09 04:37:47,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:37:47,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 04:37:47,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:37:47,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 04:37:47,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1308, Unknown=4, NotChecked=0, Total=1482 [2024-11-09 04:37:47,515 INFO L87 Difference]: Start difference. First operand 7797 states and 15776 transitions. Second operand has 39 states, 38 states have (on average 9.289473684210526) internal successors, (353), 39 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:37:59,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:37:59,343 INFO L93 Difference]: Finished difference Result 18834 states and 38099 transitions. [2024-11-09 04:37:59,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-09 04:37:59,344 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 9.289473684210526) internal successors, (353), 39 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:37:59,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:37:59,484 INFO L225 Difference]: With dead ends: 18834 [2024-11-09 04:37:59,485 INFO L226 Difference]: Without dead ends: 18790 [2024-11-09 04:37:59,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1854 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=1362, Invalid=5944, Unknown=4, NotChecked=0, Total=7310 [2024-11-09 04:37:59,497 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 2077 mSDsluCounter, 3512 mSDsCounter, 0 mSdLazyCounter, 5244 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2077 SdHoareTripleChecker+Valid, 3833 SdHoareTripleChecker+Invalid, 5371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 5244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:37:59,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2077 Valid, 3833 Invalid, 5371 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [127 Valid, 5244 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-11-09 04:37:59,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18790 states. [2024-11-09 04:37:59,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18790 to 8491. [2024-11-09 04:37:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8491 states, 8478 states have (on average 2.037037037037037) internal successors, (17270), 8490 states have internal predecessors, (17270), 0 states have call successors, (0), 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 04:38:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8491 states to 8491 states and 17270 transitions. [2024-11-09 04:38:00,120 INFO L78 Accepts]: Start accepts. Automaton has 8491 states and 17270 transitions. Word has length 202 [2024-11-09 04:38:00,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:38:00,121 INFO L471 AbstractCegarLoop]: Abstraction has 8491 states and 17270 transitions. [2024-11-09 04:38:00,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 9.289473684210526) internal successors, (353), 39 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:38:00,121 INFO L276 IsEmpty]: Start isEmpty. Operand 8491 states and 17270 transitions. [2024-11-09 04:38:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 04:38:00,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:38:00,127 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 04:38:00,153 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-09 04:38:00,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2024-11-09 04:38:00,328 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 04:38:00,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:38:00,328 INFO L85 PathProgramCache]: Analyzing trace with hash 705118577, now seen corresponding path program 9 times [2024-11-09 04:38:00,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:38:00,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142491517] [2024-11-09 04:38:00,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:38:00,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:38:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:38:01,692 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 04:38:01,693 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:38:01,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142491517] [2024-11-09 04:38:01,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142491517] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:38:01,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272750545] [2024-11-09 04:38:01,693 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 04:38:01,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:38:01,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:38:01,695 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:38:01,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 04:38:02,260 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 04:38:02,260 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:38:02,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 04:38:02,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:38:02,901 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 04:38:03,091 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 04:38:03,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:03,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:03,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:38:03,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 04:38:03,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:03,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:03,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:03,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:38:03,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2024-11-09 04:38:03,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:03,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:03,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:03,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:03,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:38:03,329 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 6 case distinctions, treesize of input 46 treesize of output 54 [2024-11-09 04:38:03,410 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 04:38:03,410 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:38:08,021 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 04:38:08,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272750545] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:38:08,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [567693909] [2024-11-09 04:38:08,022 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 04:38:08,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:38:08,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 35 [2024-11-09 04:38:08,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666443752] [2024-11-09 04:38:08,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:38:08,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 04:38:08,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:38:08,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 04:38:08,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1121, Unknown=1, NotChecked=0, Total=1260 [2024-11-09 04:38:08,025 INFO L87 Difference]: Start difference. First operand 8491 states and 17270 transitions. Second operand has 36 states, 35 states have (on average 7.314285714285714) internal successors, (256), 36 states have internal predecessors, (256), 0 states have call successors, (0), 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 04:38:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:38:20,509 INFO L93 Difference]: Finished difference Result 19042 states and 38525 transitions. [2024-11-09 04:38:20,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-09 04:38:20,510 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 7.314285714285714) internal successors, (256), 36 states have internal predecessors, (256), 0 states have call successors, (0), 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 04:38:20,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:38:20,613 INFO L225 Difference]: With dead ends: 19042 [2024-11-09 04:38:20,613 INFO L226 Difference]: Without dead ends: 18998 [2024-11-09 04:38:20,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 381 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1727 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1192, Invalid=5248, Unknown=40, NotChecked=0, Total=6480 [2024-11-09 04:38:20,622 INFO L432 NwaCegarLoop]: 407 mSDtfsCounter, 1473 mSDsluCounter, 4492 mSDsCounter, 0 mSdLazyCounter, 5066 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 4899 SdHoareTripleChecker+Invalid, 5228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 5066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:38:20,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 4899 Invalid, 5228 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [162 Valid, 5066 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2024-11-09 04:38:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18998 states. [2024-11-09 04:38:21,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18998 to 8469. [2024-11-09 04:38:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8469 states, 8456 states have (on average 2.0366603595080415) internal successors, (17222), 8468 states have internal predecessors, (17222), 0 states have call successors, (0), 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 04:38:21,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8469 states to 8469 states and 17222 transitions. [2024-11-09 04:38:21,311 INFO L78 Accepts]: Start accepts. Automaton has 8469 states and 17222 transitions. Word has length 202 [2024-11-09 04:38:21,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:38:21,312 INFO L471 AbstractCegarLoop]: Abstraction has 8469 states and 17222 transitions. [2024-11-09 04:38:21,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 7.314285714285714) internal successors, (256), 36 states have internal predecessors, (256), 0 states have call successors, (0), 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 04:38:21,312 INFO L276 IsEmpty]: Start isEmpty. Operand 8469 states and 17222 transitions. [2024-11-09 04:38:21,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 04:38:21,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:38:21,316 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 04:38:21,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-09 04:38:21,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:38:21,517 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 04:38:21,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:38:21,517 INFO L85 PathProgramCache]: Analyzing trace with hash -296840813, now seen corresponding path program 10 times [2024-11-09 04:38:21,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:38:21,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906792701] [2024-11-09 04:38:21,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:38:21,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:38:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:38:22,828 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 04:38:22,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:38:22,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906792701] [2024-11-09 04:38:22,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906792701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:38:22,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714595531] [2024-11-09 04:38:22,829 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 04:38:22,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:38:22,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:38:22,832 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:38:22,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 04:38:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:38:23,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 04:38:23,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:38:24,650 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 04:38:24,828 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 04:38:24,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:24,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:24,901 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 04:38:24,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:24,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:24,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:24,990 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 04:38:25,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:25,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:25,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:25,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:25,107 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 04:38:25,198 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 04:38:25,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:38:27,468 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 04:38:27,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714595531] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:38:27,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [427803269] [2024-11-09 04:38:27,470 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 04:38:27,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:38:27,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 38 [2024-11-09 04:38:27,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893255042] [2024-11-09 04:38:27,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:38:27,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 04:38:27,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:38:27,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 04:38:27,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1333, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 04:38:27,472 INFO L87 Difference]: Start difference. First operand 8469 states and 17222 transitions. Second operand has 39 states, 38 states have (on average 9.289473684210526) internal successors, (353), 39 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:38:39,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:38:39,781 INFO L93 Difference]: Finished difference Result 18987 states and 38411 transitions. [2024-11-09 04:38:39,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-09 04:38:39,781 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 9.289473684210526) internal successors, (353), 39 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:38:39,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:38:39,875 INFO L225 Difference]: With dead ends: 18987 [2024-11-09 04:38:39,875 INFO L226 Difference]: Without dead ends: 18943 [2024-11-09 04:38:39,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1815 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1243, Invalid=5729, Unknown=0, NotChecked=0, Total=6972 [2024-11-09 04:38:39,883 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 2318 mSDsluCounter, 4226 mSDsCounter, 0 mSdLazyCounter, 6460 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2318 SdHoareTripleChecker+Valid, 4539 SdHoareTripleChecker+Invalid, 6575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 6460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:38:39,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2318 Valid, 4539 Invalid, 6575 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [115 Valid, 6460 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2024-11-09 04:38:39,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18943 states. [2024-11-09 04:38:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18943 to 8494. [2024-11-09 04:38:40,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8494 states, 8481 states have (on average 2.036552293361632) internal successors, (17272), 8493 states have internal predecessors, (17272), 0 states have call successors, (0), 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 04:38:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8494 states to 8494 states and 17272 transitions. [2024-11-09 04:38:40,413 INFO L78 Accepts]: Start accepts. Automaton has 8494 states and 17272 transitions. Word has length 202 [2024-11-09 04:38:40,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:38:40,414 INFO L471 AbstractCegarLoop]: Abstraction has 8494 states and 17272 transitions. [2024-11-09 04:38:40,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 9.289473684210526) internal successors, (353), 39 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:38:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 8494 states and 17272 transitions. [2024-11-09 04:38:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 04:38:40,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:38:40,418 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 04:38:40,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-09 04:38:40,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2024-11-09 04:38:40,619 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 04:38:40,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:38:40,619 INFO L85 PathProgramCache]: Analyzing trace with hash -932761871, now seen corresponding path program 11 times [2024-11-09 04:38:40,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:38:40,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043248553] [2024-11-09 04:38:40,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:38:40,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:38:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:38:41,782 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 04:38:41,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:38:41,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043248553] [2024-11-09 04:38:41,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043248553] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:38:41,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060461754] [2024-11-09 04:38:41,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:38:41,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:38:41,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:38:41,786 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:38:41,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-09 04:38:42,192 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 04:38:42,192 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:38:42,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 04:38:42,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:38:43,498 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 04:38:43,604 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 04:38:43,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:43,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:43,701 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 04:38:43,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:43,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:43,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:43,808 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 04:38:43,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:43,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:43,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:43,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:38:43,934 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 04:38:44,052 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 04:38:44,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:38:44,990 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 04:38:44,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060461754] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:38:44,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1310333387] [2024-11-09 04:38:44,991 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 04:38:44,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:38:44,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 38 [2024-11-09 04:38:44,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221879345] [2024-11-09 04:38:44,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:38:44,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 04:38:44,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:38:44,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 04:38:44,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1328, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 04:38:44,994 INFO L87 Difference]: Start difference. First operand 8494 states and 17272 transitions. Second operand has 39 states, 38 states have (on average 9.289473684210526) internal successors, (353), 39 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:38:56,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:38:56,331 INFO L93 Difference]: Finished difference Result 18717 states and 37868 transitions. [2024-11-09 04:38:56,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-09 04:38:56,332 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 9.289473684210526) internal successors, (353), 39 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:38:56,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:38:56,442 INFO L225 Difference]: With dead ends: 18717 [2024-11-09 04:38:56,442 INFO L226 Difference]: Without dead ends: 18673 [2024-11-09 04:38:56,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1077, Invalid=5243, Unknown=0, NotChecked=0, Total=6320 [2024-11-09 04:38:56,452 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 2182 mSDsluCounter, 4020 mSDsCounter, 0 mSdLazyCounter, 5971 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2182 SdHoareTripleChecker+Valid, 4320 SdHoareTripleChecker+Invalid, 6065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 5971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:38:56,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2182 Valid, 4320 Invalid, 6065 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [94 Valid, 5971 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-11-09 04:38:56,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18673 states. [2024-11-09 04:38:57,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18673 to 8392. [2024-11-09 04:38:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8392 states, 8379 states have (on average 2.034610335362215) internal successors, (17048), 8391 states have internal predecessors, (17048), 0 states have call successors, (0), 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 04:38:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8392 states to 8392 states and 17048 transitions. [2024-11-09 04:38:57,196 INFO L78 Accepts]: Start accepts. Automaton has 8392 states and 17048 transitions. Word has length 202 [2024-11-09 04:38:57,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:38:57,196 INFO L471 AbstractCegarLoop]: Abstraction has 8392 states and 17048 transitions. [2024-11-09 04:38:57,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 9.289473684210526) internal successors, (353), 39 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:38:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 8392 states and 17048 transitions. [2024-11-09 04:38:57,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 04:38:57,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:38:57,201 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 04:38:57,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-09 04:38:57,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:38:57,402 INFO L396 AbstractCegarLoop]: === Iteration 72 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 04:38:57,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:38:57,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2128960313, now seen corresponding path program 1 times [2024-11-09 04:38:57,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:38:57,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735396980] [2024-11-09 04:38:57,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:38:57,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:38:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:38:58,818 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 04:38:58,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:38:58,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735396980] [2024-11-09 04:38:58,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735396980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:38:58,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262787289] [2024-11-09 04:38:58,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:38:58,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:38:58,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:38:58,822 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:38:58,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-09 04:38:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:38:59,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 04:38:59,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:39:00,590 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 04:39:00,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:39:00,655 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 23 treesize of output 11 [2024-11-09 04:39:00,704 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 04:39:00,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:39:00,773 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 04:39:00,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:39:00,852 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 04:39:00,929 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 04:39:00,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:39:01,703 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 04:39:01,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262787289] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:39:01,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1783167085] [2024-11-09 04:39:01,705 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 04:39:01,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:39:01,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 37 [2024-11-09 04:39:01,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20789500] [2024-11-09 04:39:01,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:39:01,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 04:39:01,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:39:01,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 04:39:01,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1255, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 04:39:01,708 INFO L87 Difference]: Start difference. First operand 8392 states and 17048 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 04:39:18,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:39:18,336 INFO L93 Difference]: Finished difference Result 18552 states and 37419 transitions. [2024-11-09 04:39:18,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-11-09 04:39:18,337 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 04:39:18,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:39:18,445 INFO L225 Difference]: With dead ends: 18552 [2024-11-09 04:39:18,445 INFO L226 Difference]: Without dead ends: 18443 [2024-11-09 04:39:18,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2907 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1563, Invalid=8337, Unknown=0, NotChecked=0, Total=9900 [2024-11-09 04:39:18,455 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 2128 mSDsluCounter, 6022 mSDsCounter, 0 mSdLazyCounter, 10622 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2128 SdHoareTripleChecker+Valid, 6380 SdHoareTripleChecker+Invalid, 10748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 10622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:39:18,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2128 Valid, 6380 Invalid, 10748 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [126 Valid, 10622 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2024-11-09 04:39:18,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18443 states. [2024-11-09 04:39:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18443 to 8514. [2024-11-09 04:39:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8514 states, 8501 states have (on average 2.035289965886366) internal successors, (17302), 8513 states have internal predecessors, (17302), 0 states have call successors, (0), 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 04:39:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8514 states to 8514 states and 17302 transitions. [2024-11-09 04:39:19,100 INFO L78 Accepts]: Start accepts. Automaton has 8514 states and 17302 transitions. Word has length 202 [2024-11-09 04:39:19,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:39:19,100 INFO L471 AbstractCegarLoop]: Abstraction has 8514 states and 17302 transitions. [2024-11-09 04:39:19,100 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 04:39:19,100 INFO L276 IsEmpty]: Start isEmpty. Operand 8514 states and 17302 transitions. [2024-11-09 04:39:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 04:39:19,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:39:19,104 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 04:39:19,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-09 04:39:19,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:39:19,305 INFO L396 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 04:39:19,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:39:19,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1411137445, now seen corresponding path program 12 times [2024-11-09 04:39:19,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:39:19,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609996568] [2024-11-09 04:39:19,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:39:19,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:39:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:39:20,615 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 04:39:20,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:39:20,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609996568] [2024-11-09 04:39:20,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609996568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:39:20,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023246468] [2024-11-09 04:39:20,616 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 04:39:20,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:39:20,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:39:20,618 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:39:20,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-09 04:39:21,252 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 04:39:21,252 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:39:21,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 04:39:21,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:39:21,744 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 04:39:21,867 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 04:39:22,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:39:22,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:39:22,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:39:22,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 04:39:22,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:39:22,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:39:22,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:39:22,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:39:22,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2024-11-09 04:39:22,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:39:22,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:39:22,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:39:22,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:39:22,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:39:22,326 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 6 case distinctions, treesize of input 46 treesize of output 54 [2024-11-09 04:39:22,421 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 04:39:22,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:39:31,274 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse0 (+ (* |c_t_funThread1of1ForFork0_#t~post35#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_103| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_103| .cse0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse1 |c_~#cache~0.base| (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_103| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_103| Int)) (or (= (select (select (store .cse1 |c_~#cache~0.base| (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_103| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_103| .cse0))))))) is different from false [2024-11-09 04:39:31,787 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 04:39:31,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023246468] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:39:31,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [397015482] [2024-11-09 04:39:31,789 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 04:39:31,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:39:31,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 35 [2024-11-09 04:39:31,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124507903] [2024-11-09 04:39:31,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:39:31,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 04:39:31,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:39:31,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 04:39:31,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1053, Unknown=3, NotChecked=66, Total=1260 [2024-11-09 04:39:31,793 INFO L87 Difference]: Start difference. First operand 8514 states and 17302 transitions. Second operand has 36 states, 35 states have (on average 7.314285714285714) internal successors, (256), 36 states have internal predecessors, (256), 0 states have call successors, (0), 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 04:39:44,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:39:44,392 INFO L93 Difference]: Finished difference Result 18520 states and 37479 transitions. [2024-11-09 04:39:44,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-09 04:39:44,393 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 7.314285714285714) internal successors, (256), 36 states have internal predecessors, (256), 0 states have call successors, (0), 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 04:39:44,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:39:44,494 INFO L225 Difference]: With dead ends: 18520 [2024-11-09 04:39:44,494 INFO L226 Difference]: Without dead ends: 18481 [2024-11-09 04:39:44,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 381 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2135 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=1373, Invalid=6231, Unknown=56, NotChecked=172, Total=7832 [2024-11-09 04:39:44,503 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 1073 mSDsluCounter, 5234 mSDsCounter, 0 mSdLazyCounter, 5699 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 5617 SdHoareTripleChecker+Invalid, 6884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 5699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1088 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:39:44,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 5617 Invalid, 6884 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [97 Valid, 5699 Invalid, 0 Unknown, 1088 Unchecked, 8.0s Time] [2024-11-09 04:39:44,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18481 states. [2024-11-09 04:39:44,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18481 to 8504. [2024-11-09 04:39:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8504 states, 8491 states have (on average 2.0348604404663764) internal successors, (17278), 8503 states have internal predecessors, (17278), 0 states have call successors, (0), 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 04:39:44,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8504 states to 8504 states and 17278 transitions. [2024-11-09 04:39:45,056 INFO L78 Accepts]: Start accepts. Automaton has 8504 states and 17278 transitions. Word has length 202 [2024-11-09 04:39:45,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:39:45,056 INFO L471 AbstractCegarLoop]: Abstraction has 8504 states and 17278 transitions. [2024-11-09 04:39:45,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 7.314285714285714) internal successors, (256), 36 states have internal predecessors, (256), 0 states have call successors, (0), 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 04:39:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 8504 states and 17278 transitions. [2024-11-09 04:39:45,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 04:39:45,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:39:45,061 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 04:39:45,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-09 04:39:45,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:39:45,262 INFO L396 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 04:39:45,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:39:45,262 INFO L85 PathProgramCache]: Analyzing trace with hash -233272625, now seen corresponding path program 13 times [2024-11-09 04:39:45,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:39:45,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950094573] [2024-11-09 04:39:45,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:39:45,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:39:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:39:46,437 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 04:39:46,438 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:39:46,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950094573] [2024-11-09 04:39:46,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950094573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:39:46,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663110487] [2024-11-09 04:39:46,438 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 04:39:46,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:39:46,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:39:46,440 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:39:46,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-09 04:39:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:39:46,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 04:39:46,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:39:48,349 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 04:39:48,766 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 04:39:48,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:39:48,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:39:48,854 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 04:39:48,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:39:48,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:39:48,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:39:48,957 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 04:39:49,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:39:49,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:39:49,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:39:49,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:39:49,077 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 04:39:49,194 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 04:39:49,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:39:53,897 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse3 (+ (* |c_t_funThread1of1ForFork0_#t~post35#1| 28) 28 |c_~#cache~0.offset|)) (.cse1 (select .cse0 |c_~#cache~0.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int)) (or (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| .cse3))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| .cse3) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))))) is different from false [2024-11-09 04:39:54,468 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 04:39:54,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663110487] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:39:54,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [179204870] [2024-11-09 04:39:54,470 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 04:39:54,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:39:54,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 38 [2024-11-09 04:39:54,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417994965] [2024-11-09 04:39:54,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:39:54,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 04:39:54,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:39:54,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 04:39:54,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1264, Unknown=1, NotChecked=72, Total=1482 [2024-11-09 04:39:54,474 INFO L87 Difference]: Start difference. First operand 8504 states and 17278 transitions. Second operand has 39 states, 38 states have (on average 9.289473684210526) internal successors, (353), 39 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:40:10,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:40:10,249 INFO L93 Difference]: Finished difference Result 18594 states and 37630 transitions. [2024-11-09 04:40:10,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-09 04:40:10,249 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 9.289473684210526) internal successors, (353), 39 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:40:10,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:40:10,359 INFO L225 Difference]: With dead ends: 18594 [2024-11-09 04:40:10,359 INFO L226 Difference]: Without dead ends: 18555 [2024-11-09 04:40:10,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2564 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=1600, Invalid=7715, Unknown=1, NotChecked=190, Total=9506 [2024-11-09 04:40:10,369 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 1547 mSDsluCounter, 4647 mSDsCounter, 0 mSdLazyCounter, 7210 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 4948 SdHoareTripleChecker+Invalid, 8537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 7210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1179 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:40:10,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1547 Valid, 4948 Invalid, 8537 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [148 Valid, 7210 Invalid, 0 Unknown, 1179 Unchecked, 10.3s Time] [2024-11-09 04:40:10,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18555 states. [2024-11-09 04:40:10,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18555 to 8465. [2024-11-09 04:40:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8465 states, 8452 states have (on average 2.0347846663511593) internal successors, (17198), 8464 states have internal predecessors, (17198), 0 states have call successors, (0), 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 04:40:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8465 states to 8465 states and 17198 transitions. [2024-11-09 04:40:11,099 INFO L78 Accepts]: Start accepts. Automaton has 8465 states and 17198 transitions. Word has length 202 [2024-11-09 04:40:11,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:40:11,099 INFO L471 AbstractCegarLoop]: Abstraction has 8465 states and 17198 transitions. [2024-11-09 04:40:11,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 9.289473684210526) internal successors, (353), 39 states have internal predecessors, (353), 0 states have call successors, (0), 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 04:40:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand 8465 states and 17198 transitions. [2024-11-09 04:40:11,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 04:40:11,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:40:11,104 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 04:40:11,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-11-09 04:40:11,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:40:11,305 INFO L396 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 04:40:11,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:40:11,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1691518075, now seen corresponding path program 1 times [2024-11-09 04:40:11,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:40:11,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449049616] [2024-11-09 04:40:11,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:40:11,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:40:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:40:13,788 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 04:40:13,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:40:13,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449049616] [2024-11-09 04:40:13,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449049616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:40:13,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853492465] [2024-11-09 04:40:13,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:40:13,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:40:13,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:40:13,790 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:40:13,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-09 04:40:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:40:14,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-09 04:40:14,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:40:15,622 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 04:40:15,698 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 04:40:15,790 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 04:40:15,902 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 04:40:16,662 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 04:40:16,780 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 04:40:16,825 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 04:40:16,963 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 04:40:17,136 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 04:40:17,222 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 04:40:17,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:40:23,969 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 04:40:23,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853492465] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:40:23,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [356069916] [2024-11-09 04:40:23,970 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java: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 04:40:23,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:40:23,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 17] total 46 [2024-11-09 04:40:23,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785844348] [2024-11-09 04:40:23,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:40:23,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-09 04:40:23,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:40:23,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-09 04:40:23,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1871, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 04:40:23,973 INFO L87 Difference]: Start difference. First operand 8465 states and 17198 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 04:41:04,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 04:41:10,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 04:41:19,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 04:41:37,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 04:41:41,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:41,500 INFO L93 Difference]: Finished difference Result 19348 states and 39096 transitions. [2024-11-09 04:41:41,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-09 04:41:41,500 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 04:41:41,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:41,606 INFO L225 Difference]: With dead ends: 19348 [2024-11-09 04:41:41,607 INFO L226 Difference]: Without dead ends: 19014 [2024-11-09 04:41:41,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 376 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2464 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=1245, Invalid=6411, Unknown=0, NotChecked=0, Total=7656 [2024-11-09 04:41:41,617 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 1637 mSDsluCounter, 4609 mSDsCounter, 0 mSdLazyCounter, 7510 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1637 SdHoareTripleChecker+Valid, 4891 SdHoareTripleChecker+Invalid, 7585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 7510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:41,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1637 Valid, 4891 Invalid, 7585 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [75 Valid, 7510 Invalid, 0 Unknown, 0 Unchecked, 65.8s Time] [2024-11-09 04:41:41,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19014 states. [2024-11-09 04:41:42,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19014 to 8535. [2024-11-09 04:41:42,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8535 states, 8522 states have (on average 2.034733630603145) internal successors, (17340), 8534 states have internal predecessors, (17340), 0 states have call successors, (0), 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 04:41:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8535 states to 8535 states and 17340 transitions. [2024-11-09 04:41:42,189 INFO L78 Accepts]: Start accepts. Automaton has 8535 states and 17340 transitions. Word has length 202 [2024-11-09 04:41:42,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:42,189 INFO L471 AbstractCegarLoop]: Abstraction has 8535 states and 17340 transitions. [2024-11-09 04:41:42,190 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 04:41:42,190 INFO L276 IsEmpty]: Start isEmpty. Operand 8535 states and 17340 transitions. [2024-11-09 04:41:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 04:41:42,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:42,194 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 04:41:42,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-09 04:41:42,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:41:42,394 INFO L396 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 04:41:42,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:42,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1885582665, now seen corresponding path program 2 times [2024-11-09 04:41:42,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:41:42,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293367060] [2024-11-09 04:41:42,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:42,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:41:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:41:44,802 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 04:41:44,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:41:44,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293367060] [2024-11-09 04:41:44,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293367060] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:41:44,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831993941] [2024-11-09 04:41:44,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:41:44,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:41:44,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:41:44,805 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:41:44,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-09 04:41:45,270 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 04:41:45,270 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:41:45,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 04:41:45,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:41:46,104 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 04:41:46,177 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 04:41:46,254 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 04:41:46,578 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 04:41:47,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,094 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 04:41:47,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,239 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 61 treesize of output 57 [2024-11-09 04:41:47,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,308 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 66 [2024-11-09 04:41:47,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,470 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 70 treesize of output 69 [2024-11-09 04:41:47,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:41:47,685 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 66 treesize of output 62 [2024-11-09 04:41:55,821 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-09 04:41:55,821 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:08,508 WARN L851 $PredicateComparison]: unable to prove that (let ((.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 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse2 (+ (* |c_t_funThread1of1ForFork0_#t~post35#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_4857 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|) v_ArrVal_4857) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| |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_118| .cse2))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_4857 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| .cse2) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|) v_ArrVal_4857) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3) 0))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_4857 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| .cse2) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|) v_ArrVal_4857) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| |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 ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_4857 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|) v_ArrVal_4857) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| |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_118| .cse2))))))) is different from false [2024-11-09 04:42:10,585 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 ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_4857 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| .cse0) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store .cse2 (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|) v_ArrVal_4857) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3) 0))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_4857 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| .cse0) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store .cse2 (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|) v_ArrVal_4857) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| |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 ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_4857 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| .cse0) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store .cse2 (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|) v_ArrVal_4857) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| |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 ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_4857 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| .cse0) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store .cse2 (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|) v_ArrVal_4857) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| |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 04:42:12,724 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 ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_4857 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|) v_ArrVal_4857) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| |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_118| .cse2))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_4857 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| .cse2) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|) v_ArrVal_4857) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3) 0))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_4857 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|) v_ArrVal_4857) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| |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_118| .cse2))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_4857 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|) v_ArrVal_4857) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| |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_118| .cse2))))))) is different from false [2024-11-09 04:42:14,832 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.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 (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0) .cse4 0) .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 ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_4857 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|) v_ArrVal_4857) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| |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_118| .cse3))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_4857 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|) v_ArrVal_4857) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| |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_118| .cse3))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_4857 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|) v_ArrVal_4857) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| |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_118| .cse3))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_4857 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store .cse1 (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|) v_ArrVal_4857) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| .cse3))))))) is different from false [2024-11-09 04:42:15,501 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 04:42:15,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831993941] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:42:15,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1671674539] [2024-11-09 04:42:15,502 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 04:42:15,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:42:15,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 15] total 43 [2024-11-09 04:42:15,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488332015] [2024-11-09 04:42:15,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:42:15,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-09 04:42:15,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:42:15,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 04:42:15,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1360, Unknown=10, NotChecked=316, Total=1892 [2024-11-09 04:42:15,505 INFO L87 Difference]: Start difference. First operand 8535 states and 17340 transitions. Second operand has 44 states, 43 states have (on average 8.255813953488373) internal successors, (355), 44 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 04:42:28,013 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 04:42:30,085 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 04:42:32,522 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 04:42:34,601 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 04:42:37,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 04:42:39,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 04:42:41,514 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 04:42:43,831 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 04:42:48,933 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 04:42:51,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 04:42:53,021 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 04:42:55,239 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 04:42:59,788 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 04:43:03,909 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 04:43:06,053 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 04:43:08,240 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 04:43:10,245 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 04:43:14,367 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 04:43:16,801 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 04:43:18,807 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 04:43:20,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 04:43:22,878 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 04:43:27,380 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 04:43:29,430 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 04:43:31,439 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 04:43:33,493 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 04:43:35,504 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 04:43:37,681 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 04:43:39,687 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 04:43:41,741 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 04:43:43,753 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 04:43:47,856 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 04:43:49,875 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 04:43:51,881 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 04:43:53,954 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 04:43:55,959 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 04:43:57,980 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 04:44:00,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 04:44:02,043 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 04:44:04,055 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 04:44:08,181 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 04:44:10,229 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 04:44:12,275 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 04:44:14,495 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 04:44:16,505 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 04:44:18,512 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 04:44:20,523 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 04:44:22,769 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 04:44:24,856 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 04:44:26,880 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 04:44:31,306 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 04:44:33,731 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 04:44:36,756 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 04:44:38,769 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 04:44:41,083 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 04:44:43,327 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 04:44:49,705 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 04:44:53,060 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 04:44:55,122 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 04:44:57,450 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 04:44:59,455 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 04:45:01,463 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 04:45:03,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 04:45:05,493 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 04:45:07,504 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 04:45:09,794 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 04:45:11,810 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 04:45:13,824 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 04:45:15,869 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 04:45:17,889 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 04:45:21,999 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 04:45:24,018 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 04:45:26,048 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 04:45:28,056 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 04:45:32,167 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 04:45:34,173 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 04:45:36,182 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 04:45:38,197 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 04:45:40,205 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 04:45:42,281 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 04:45:44,286 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 04:45:46,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:46,809 INFO L93 Difference]: Finished difference Result 18547 states and 37599 transitions. [2024-11-09 04:45:46,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-09 04:45:46,810 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 8.255813953488373) internal successors, (355), 44 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 04:45:46,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:46,889 INFO L225 Difference]: With dead ends: 18547 [2024-11-09 04:45:46,890 INFO L226 Difference]: Without dead ends: 18513 [2024-11-09 04:45:46,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 381 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 55.0s TimeCoverageRelationStatistics Valid=941, Invalid=3883, Unknown=22, NotChecked=556, Total=5402 [2024-11-09 04:45:46,897 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 1650 mSDsluCounter, 3407 mSDsCounter, 0 mSdLazyCounter, 5135 mSolverCounterSat, 105 mSolverCounterUnsat, 81 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 181.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1650 SdHoareTripleChecker+Valid, 3676 SdHoareTripleChecker+Invalid, 9125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 5135 IncrementalHoareTripleChecker+Invalid, 81 IncrementalHoareTripleChecker+Unknown, 3804 IncrementalHoareTripleChecker+Unchecked, 182.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:46,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1650 Valid, 3676 Invalid, 9125 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [105 Valid, 5135 Invalid, 81 Unknown, 3804 Unchecked, 182.9s Time] [2024-11-09 04:45:46,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18513 states. [2024-11-09 04:45:47,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18513 to 8521. [2024-11-09 04:45:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8521 states, 8508 states have (on average 2.035025858015985) internal successors, (17314), 8520 states have internal predecessors, (17314), 0 states have call successors, (0), 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 04:45:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8521 states to 8521 states and 17314 transitions. [2024-11-09 04:45:47,368 INFO L78 Accepts]: Start accepts. Automaton has 8521 states and 17314 transitions. Word has length 202 [2024-11-09 04:45:47,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:47,368 INFO L471 AbstractCegarLoop]: Abstraction has 8521 states and 17314 transitions. [2024-11-09 04:45:47,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 8.255813953488373) internal successors, (355), 44 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 04:45:47,368 INFO L276 IsEmpty]: Start isEmpty. Operand 8521 states and 17314 transitions. [2024-11-09 04:45:47,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 04:45:47,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:47,373 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 04:45:47,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-09 04:45:47,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:45:47,574 INFO L396 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 04:45:47,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:47,574 INFO L85 PathProgramCache]: Analyzing trace with hash 499177771, now seen corresponding path program 3 times [2024-11-09 04:45:47,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:47,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361955775] [2024-11-09 04:45:47,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:47,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:49,380 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 04:45:49,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:49,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361955775] [2024-11-09 04:45:49,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361955775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:45:49,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827057127] [2024-11-09 04:45:49,381 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 04:45:49,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:45:49,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:45:49,382 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:45:49,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5942150-6540-498d-8905-9a9d1d0acf8e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-09 04:45:49,905 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 04:45:49,905 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:45:49,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 04:45:49,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:45:50,561 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 04:45:50,619 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 04:45:50,698 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