./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array-race.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91 --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 c3ac8edf9cc34df23835297b42f3eb24b0fecd781f1d2abb112aaac7f99695b4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 23:22:22,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 23:22:22,519 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DataRace-32bit-Taipan_Default.epf [2023-11-24 23:22:22,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 23:22:22,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 23:22:22,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 23:22:22,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 23:22:22,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 23:22:22,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 23:22:22,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 23:22:22,578 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-24 23:22:22,579 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-24 23:22:22,580 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-24 23:22:22,581 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-24 23:22:22,582 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-24 23:22:22,582 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-24 23:22:22,583 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-24 23:22:22,583 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-24 23:22:22,584 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-24 23:22:22,584 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-24 23:22:22,585 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-24 23:22:22,585 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-24 23:22:22,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 23:22:22,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 23:22:22,587 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 23:22:22,588 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 23:22:22,588 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 23:22:22,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 23:22:22,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 23:22:22,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 23:22:22,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 23:22:22,591 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-24 23:22:22,591 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 23:22:22,591 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 23:22:22,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 23:22:22,592 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 23:22:22,592 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 23:22:22,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 23:22:22,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:22:22,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 23:22:22,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 23:22:22,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 23:22:22,595 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-24 23:22:22,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 23:22:22,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 23:22:22,596 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 23:22:22,596 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-24 23:22:22,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 23:22:22,596 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_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/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_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91 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 -> c3ac8edf9cc34df23835297b42f3eb24b0fecd781f1d2abb112aaac7f99695b4 [2023-11-24 23:22:22,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 23:22:22,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 23:22:23,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 23:22:23,002 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 23:22:23,002 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 23:22:23,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array-race.i [2023-11-24 23:22:26,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 23:22:26,431 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 23:22:26,431 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-in-array-race.i [2023-11-24 23:22:26,453 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/data/10fc4ec3b/0fb6d6ae69c745a08f331b982c9e6103/FLAGd4e6d9487 [2023-11-24 23:22:26,473 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/data/10fc4ec3b/0fb6d6ae69c745a08f331b982c9e6103 [2023-11-24 23:22:26,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 23:22:26,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 23:22:26,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 23:22:26,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 23:22:26,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 23:22:26,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:22:26" (1/1) ... [2023-11-24 23:22:26,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f93945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:22:26, skipping insertion in model container [2023-11-24 23:22:26,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:22:26" (1/1) ... [2023-11-24 23:22:26,550 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 23:22:27,138 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:22:27,148 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 23:22:27,217 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:22:27,292 INFO L206 MainTranslator]: Completed translation [2023-11-24 23:22:27,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:22:27 WrapperNode [2023-11-24 23:22:27,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 23:22:27,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 23:22:27,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 23:22:27,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 23:22:27,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:22:27" (1/1) ... [2023-11-24 23:22:27,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:22:27" (1/1) ... [2023-11-24 23:22:27,392 INFO L138 Inliner]: procedures = 265, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2023-11-24 23:22:27,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 23:22:27,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 23:22:27,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 23:22:27,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 23:22:27,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:22:27" (1/1) ... [2023-11-24 23:22:27,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:22:27" (1/1) ... [2023-11-24 23:22:27,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:22:27" (1/1) ... [2023-11-24 23:22:27,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:22:27" (1/1) ... [2023-11-24 23:22:27,423 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:22:27" (1/1) ... [2023-11-24 23:22:27,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:22:27" (1/1) ... [2023-11-24 23:22:27,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:22:27" (1/1) ... [2023-11-24 23:22:27,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:22:27" (1/1) ... [2023-11-24 23:22:27,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 23:22:27,436 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 23:22:27,436 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 23:22:27,437 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 23:22:27,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:22:27" (1/1) ... [2023-11-24 23:22:27,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:22:27,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:22:27,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 23:22:27,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 23:22:27,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 23:22:27,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-24 23:22:27,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 23:22:27,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-24 23:22:27,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 23:22:27,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 23:22:27,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 23:22:27,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-24 23:22:27,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-24 23:22:27,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 23:22:27,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 23:22:27,512 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 23:22:27,658 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 23:22:27,661 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 23:22:28,023 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 23:22:28,036 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 23:22:28,039 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-24 23:22:28,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:22:28 BoogieIcfgContainer [2023-11-24 23:22:28,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 23:22:28,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 23:22:28,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 23:22:28,052 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 23:22:28,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 11:22:26" (1/3) ... [2023-11-24 23:22:28,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e942e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:22:28, skipping insertion in model container [2023-11-24 23:22:28,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:22:27" (2/3) ... [2023-11-24 23:22:28,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e942e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:22:28, skipping insertion in model container [2023-11-24 23:22:28,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:22:28" (3/3) ... [2023-11-24 23:22:28,062 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array-race.i [2023-11-24 23:22:28,072 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 23:22:28,085 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 23:22:28,085 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-24 23:22:28,086 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 23:22:28,226 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-24 23:22:28,267 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 121 places, 122 transitions, 251 flow [2023-11-24 23:22:28,406 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1324 states, 1300 states have (on average 1.9330769230769231) internal successors, (2513), 1323 states have internal predecessors, (2513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:28,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 23:22:28,443 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6d0581cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 23:22:28,444 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-11-24 23:22:28,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 1324 states, 1300 states have (on average 1.9330769230769231) internal successors, (2513), 1323 states have internal predecessors, (2513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-24 23:22:28,458 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:22:28,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:22:28,460 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-24 23:22:28,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:22:28,482 INFO L85 PathProgramCache]: Analyzing trace with hash 578939384, now seen corresponding path program 1 times [2023-11-24 23:22:28,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:22:28,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526878221] [2023-11-24 23:22:28,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:22:28,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:22:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:22:29,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:22:29,546 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:22:29,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526878221] [2023-11-24 23:22:29,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526878221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:22:29,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:22:29,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:22:29,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110576314] [2023-11-24 23:22:29,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:22:29,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:22:29,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:22:29,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:22:29,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:22:29,623 INFO L87 Difference]: Start difference. First operand has 1324 states, 1300 states have (on average 1.9330769230769231) internal successors, (2513), 1323 states have internal predecessors, (2513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:30,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:22:30,061 INFO L93 Difference]: Finished difference Result 1578 states and 2949 transitions. [2023-11-24 23:22:30,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:22:30,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-24 23:22:30,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:22:30,088 INFO L225 Difference]: With dead ends: 1578 [2023-11-24 23:22:30,089 INFO L226 Difference]: Without dead ends: 1438 [2023-11-24 23:22:30,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:22:30,094 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 122 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:22:30,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 279 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 23:22:30,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2023-11-24 23:22:30,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1283. [2023-11-24 23:22:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1263 states have (on average 1.894695170229612) internal successors, (2393), 1282 states have internal predecessors, (2393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:30,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 2393 transitions. [2023-11-24 23:22:30,215 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 2393 transitions. Word has length 30 [2023-11-24 23:22:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:22:30,216 INFO L495 AbstractCegarLoop]: Abstraction has 1283 states and 2393 transitions. [2023-11-24 23:22:30,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 2393 transitions. [2023-11-24 23:22:30,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-24 23:22:30,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:22:30,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:22:30,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 23:22:30,219 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-24 23:22:30,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:22:30,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2012313278, now seen corresponding path program 1 times [2023-11-24 23:22:30,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:22:30,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277562442] [2023-11-24 23:22:30,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:22:30,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:22:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:22:30,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:22:30,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:22:30,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277562442] [2023-11-24 23:22:30,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277562442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:22:30,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:22:30,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:22:30,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623536660] [2023-11-24 23:22:30,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:22:30,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 23:22:30,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:22:30,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 23:22:30,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:22:30,370 INFO L87 Difference]: Start difference. First operand 1283 states and 2393 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:30,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:22:30,441 INFO L93 Difference]: Finished difference Result 1292 states and 2401 transitions. [2023-11-24 23:22:30,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:22:30,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-11-24 23:22:30,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:22:30,451 INFO L225 Difference]: With dead ends: 1292 [2023-11-24 23:22:30,452 INFO L226 Difference]: Without dead ends: 1292 [2023-11-24 23:22:30,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:22:30,456 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 49 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:22:30,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 324 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:22:30,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2023-11-24 23:22:30,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1284. [2023-11-24 23:22:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 1264 states have (on average 1.893987341772152) internal successors, (2394), 1283 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2394 transitions. [2023-11-24 23:22:30,499 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2394 transitions. Word has length 33 [2023-11-24 23:22:30,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:22:30,499 INFO L495 AbstractCegarLoop]: Abstraction has 1284 states and 2394 transitions. [2023-11-24 23:22:30,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:30,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2394 transitions. [2023-11-24 23:22:30,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-24 23:22:30,501 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:22:30,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:22:30,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 23:22:30,501 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-24 23:22:30,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:22:30,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1180280619, now seen corresponding path program 1 times [2023-11-24 23:22:30,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:22:30,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275512801] [2023-11-24 23:22:30,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:22:30,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:22:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:22:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:22:30,917 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:22:30,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275512801] [2023-11-24 23:22:30,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275512801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:22:30,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:22:30,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:22:30,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126768815] [2023-11-24 23:22:30,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:22:30,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:22:30,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:22:30,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:22:30,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:22:30,928 INFO L87 Difference]: Start difference. First operand 1284 states and 2394 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:31,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:22:31,216 INFO L93 Difference]: Finished difference Result 1572 states and 2897 transitions. [2023-11-24 23:22:31,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:22:31,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-24 23:22:31,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:22:31,227 INFO L225 Difference]: With dead ends: 1572 [2023-11-24 23:22:31,228 INFO L226 Difference]: Without dead ends: 1521 [2023-11-24 23:22:31,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:22:31,235 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 174 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:22:31,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 200 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 23:22:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2023-11-24 23:22:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1335. [2023-11-24 23:22:31,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 1318 states have (on average 1.8899848254931715) internal successors, (2491), 1334 states have internal predecessors, (2491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 2491 transitions. [2023-11-24 23:22:31,285 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 2491 transitions. Word has length 34 [2023-11-24 23:22:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:22:31,286 INFO L495 AbstractCegarLoop]: Abstraction has 1335 states and 2491 transitions. [2023-11-24 23:22:31,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 2491 transitions. [2023-11-24 23:22:31,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-24 23:22:31,297 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:22:31,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:22:31,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 23:22:31,297 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-24 23:22:31,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:22:31,298 INFO L85 PathProgramCache]: Analyzing trace with hash -396544275, now seen corresponding path program 1 times [2023-11-24 23:22:31,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:22:31,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512603557] [2023-11-24 23:22:31,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:22:31,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:22:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:22:31,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:22:31,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:22:31,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512603557] [2023-11-24 23:22:31,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512603557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:22:31,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:22:31,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:22:31,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124814555] [2023-11-24 23:22:31,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:22:31,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:22:31,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:22:31,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:22:31,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:22:31,775 INFO L87 Difference]: Start difference. First operand 1335 states and 2491 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:32,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:22:32,371 INFO L93 Difference]: Finished difference Result 1626 states and 3036 transitions. [2023-11-24 23:22:32,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:22:32,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2023-11-24 23:22:32,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:22:32,383 INFO L225 Difference]: With dead ends: 1626 [2023-11-24 23:22:32,383 INFO L226 Difference]: Without dead ends: 1505 [2023-11-24 23:22:32,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:22:32,390 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 194 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 23:22:32,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 571 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 23:22:32,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2023-11-24 23:22:32,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1411. [2023-11-24 23:22:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1394 states have (on average 1.8830703012912482) internal successors, (2625), 1410 states have internal predecessors, (2625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:32,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2625 transitions. [2023-11-24 23:22:32,443 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2625 transitions. Word has length 51 [2023-11-24 23:22:32,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:22:32,446 INFO L495 AbstractCegarLoop]: Abstraction has 1411 states and 2625 transitions. [2023-11-24 23:22:32,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:32,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2625 transitions. [2023-11-24 23:22:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-24 23:22:32,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:22:32,450 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-24 23:22:32,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 23:22:32,451 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-24 23:22:32,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:22:32,452 INFO L85 PathProgramCache]: Analyzing trace with hash 219560125, now seen corresponding path program 1 times [2023-11-24 23:22:32,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:22:32,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96407310] [2023-11-24 23:22:32,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:22:32,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:22:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:22:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:22:33,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:22:33,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96407310] [2023-11-24 23:22:33,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96407310] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:22:33,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912099769] [2023-11-24 23:22:33,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:22:33,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:22:33,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:22:33,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:22:33,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 23:22:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:22:33,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-24 23:22:33,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:22:33,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:22:33,586 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 23:22:33,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-24 23:22:33,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-24 23:22:33,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 23:22:33,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-24 23:22:34,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-24 23:22:34,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-24 23:22:34,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 23:22:34,249 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:22:34,249 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:22:34,284 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_192) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_192) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_192) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_192) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))) is different from false [2023-11-24 23:22:34,323 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_192) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_192) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_192) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_192) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))))) is different from false [2023-11-24 23:22:34,372 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_192) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_192) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_192) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_192) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0))))) is different from false [2023-11-24 23:22:34,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-24 23:22:34,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-24 23:22:34,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912099769] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:22:34,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [351618768] [2023-11-24 23:22:34,546 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-24 23:22:34,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:22:34,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2023-11-24 23:22:34,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969102217] [2023-11-24 23:22:34,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:22:34,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-24 23:22:34,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:22:34,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-24 23:22:34,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=609, Unknown=3, NotChecked=156, Total=870 [2023-11-24 23:22:34,554 INFO L87 Difference]: Start difference. First operand 1411 states and 2625 transitions. Second operand has 30 states, 29 states have (on average 3.8620689655172415) internal successors, (112), 30 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:36,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:22:36,364 INFO L93 Difference]: Finished difference Result 1383 states and 2571 transitions. [2023-11-24 23:22:36,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-24 23:22:36,365 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.8620689655172415) internal successors, (112), 30 states have internal predecessors, (112), 0 states have call successors, (0), 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 61 [2023-11-24 23:22:36,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:22:36,375 INFO L225 Difference]: With dead ends: 1383 [2023-11-24 23:22:36,378 INFO L226 Difference]: Without dead ends: 1352 [2023-11-24 23:22:36,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=330, Invalid=1485, Unknown=3, NotChecked=252, Total=2070 [2023-11-24 23:22:36,380 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 1126 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 2560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 777 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:22:36,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 1362 Invalid, 2560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1567 Invalid, 0 Unknown, 777 Unchecked, 1.2s Time] [2023-11-24 23:22:36,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2023-11-24 23:22:36,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1294. [2023-11-24 23:22:36,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1281 states have (on average 1.879000780640125) internal successors, (2407), 1293 states have internal predecessors, (2407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 2407 transitions. [2023-11-24 23:22:36,422 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 2407 transitions. Word has length 61 [2023-11-24 23:22:36,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:22:36,429 INFO L495 AbstractCegarLoop]: Abstraction has 1294 states and 2407 transitions. [2023-11-24 23:22:36,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.8620689655172415) internal successors, (112), 30 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 2407 transitions. [2023-11-24 23:22:36,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-24 23:22:36,433 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:22:36,433 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:22:36,445 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 23:22:36,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:22:36,640 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-24 23:22:36,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:22:36,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1572533367, now seen corresponding path program 1 times [2023-11-24 23:22:36,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:22:36,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836013754] [2023-11-24 23:22:36,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:22:36,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:22:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:22:37,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:22:37,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:22:37,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836013754] [2023-11-24 23:22:37,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836013754] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:22:37,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693045637] [2023-11-24 23:22:37,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:22:37,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:22:37,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:22:37,424 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:22:37,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 23:22:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:22:37,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-24 23:22:37,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:22:37,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:22:37,600 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 23:22:37,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-24 23:22:37,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-24 23:22:37,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 23:22:37,676 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 [2023-11-24 23:22:37,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:22:37,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-24 23:22:37,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:22:37,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-24 23:22:37,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 23:22:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:22:37,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:22:37,786 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_292) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_292) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_292) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_292) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-24 23:22:37,808 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_292 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_292) c_threadThread1of1ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_292) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_292) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_292) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-24 23:22:37,830 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_292) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_292) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_292 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_292) c_threadThread1of1ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_292) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-24 23:22:37,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-24 23:22:37,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-24 23:22:37,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693045637] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:22:37,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [509009772] [2023-11-24 23:22:37,965 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-24 23:22:37,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:22:37,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 17 [2023-11-24 23:22:37,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375733426] [2023-11-24 23:22:37,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:22:37,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-24 23:22:37,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:22:37,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-24 23:22:37,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=174, Unknown=3, NotChecked=84, Total=306 [2023-11-24 23:22:37,969 INFO L87 Difference]: Start difference. First operand 1294 states and 2407 transitions. Second operand has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:22:39,982 INFO L93 Difference]: Finished difference Result 1396 states and 2589 transitions. [2023-11-24 23:22:39,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-24 23:22:39,983 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 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 61 [2023-11-24 23:22:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:22:39,992 INFO L225 Difference]: With dead ends: 1396 [2023-11-24 23:22:39,992 INFO L226 Difference]: Without dead ends: 1374 [2023-11-24 23:22:39,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=371, Invalid=1198, Unknown=3, NotChecked=234, Total=1806 [2023-11-24 23:22:39,994 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 723 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 1628 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 3262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1590 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:22:39,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1859 Invalid, 3262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1628 Invalid, 0 Unknown, 1590 Unchecked, 1.3s Time] [2023-11-24 23:22:39,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2023-11-24 23:22:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1271. [2023-11-24 23:22:40,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1258 states have (on average 1.8696343402225755) internal successors, (2352), 1270 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:40,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 2352 transitions. [2023-11-24 23:22:40,034 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 2352 transitions. Word has length 61 [2023-11-24 23:22:40,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:22:40,034 INFO L495 AbstractCegarLoop]: Abstraction has 1271 states and 2352 transitions. [2023-11-24 23:22:40,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 2352 transitions. [2023-11-24 23:22:40,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-24 23:22:40,037 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:22:40,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:22:40,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 23:22:40,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-24 23:22:40,243 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-24 23:22:40,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:22:40,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1234583565, now seen corresponding path program 1 times [2023-11-24 23:22:40,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:22:40,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300380501] [2023-11-24 23:22:40,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:22:40,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:22:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:22:40,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 23:22:40,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:22:40,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300380501] [2023-11-24 23:22:40,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300380501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:22:40,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:22:40,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:22:40,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479008007] [2023-11-24 23:22:40,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:22:40,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:22:40,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:22:40,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:22:40,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:22:40,726 INFO L87 Difference]: Start difference. First operand 1271 states and 2352 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:22:40,919 INFO L93 Difference]: Finished difference Result 1316 states and 2425 transitions. [2023-11-24 23:22:40,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:22:40,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2023-11-24 23:22:40,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:22:40,927 INFO L225 Difference]: With dead ends: 1316 [2023-11-24 23:22:40,928 INFO L226 Difference]: Without dead ends: 1197 [2023-11-24 23:22:40,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:22:40,929 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 52 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:22:40,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 317 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:22:40,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2023-11-24 23:22:40,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1193. [2023-11-24 23:22:40,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1181 states have (on average 1.8619813717188822) internal successors, (2199), 1192 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:40,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 2199 transitions. [2023-11-24 23:22:40,978 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 2199 transitions. Word has length 63 [2023-11-24 23:22:40,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:22:40,979 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 2199 transitions. [2023-11-24 23:22:40,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 2199 transitions. [2023-11-24 23:22:40,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-24 23:22:40,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:22:40,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:22:40,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 23:22:40,984 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-24 23:22:40,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:22:40,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1045271809, now seen corresponding path program 1 times [2023-11-24 23:22:40,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:22:40,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521394947] [2023-11-24 23:22:40,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:22:40,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:22:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:22:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:22:41,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:22:41,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521394947] [2023-11-24 23:22:41,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521394947] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:22:41,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031966152] [2023-11-24 23:22:41,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:22:41,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:22:41,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:22:41,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:22:41,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 23:22:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:22:41,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-24 23:22:41,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:22:42,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-24 23:22:42,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 23:22:42,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-24 23:22:42,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-24 23:22:42,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-24 23:22:42,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:22:42,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 23:22:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:22:42,553 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:22:42,719 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_438 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_438) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_438 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_438) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_438 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_438) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_438 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_438) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false [2023-11-24 23:22:42,742 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_438 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_438) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_438 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_438) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_438 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_438) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_438 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_438) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false [2023-11-24 23:22:42,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-24 23:22:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:22:43,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031966152] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:22:43,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1555365383] [2023-11-24 23:22:43,023 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-24 23:22:43,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:22:43,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2023-11-24 23:22:43,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329499161] [2023-11-24 23:22:43,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:22:43,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-24 23:22:43,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:22:43,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-24 23:22:43,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=925, Unknown=12, NotChecked=126, Total=1190 [2023-11-24 23:22:43,027 INFO L87 Difference]: Start difference. First operand 1193 states and 2199 transitions. Second operand has 35 states, 34 states have (on average 4.382352941176471) internal successors, (149), 35 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:44,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:22:44,361 INFO L93 Difference]: Finished difference Result 1151 states and 2118 transitions. [2023-11-24 23:22:44,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 23:22:44,361 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.382352941176471) internal successors, (149), 35 states have internal predecessors, (149), 0 states have call successors, (0), 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 64 [2023-11-24 23:22:44,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:22:44,369 INFO L225 Difference]: With dead ends: 1151 [2023-11-24 23:22:44,369 INFO L226 Difference]: Without dead ends: 1110 [2023-11-24 23:22:44,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=312, Invalid=1664, Unknown=12, NotChecked=174, Total=2162 [2023-11-24 23:22:44,370 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 864 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 460 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:22:44,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 910 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1029 Invalid, 0 Unknown, 460 Unchecked, 1.0s Time] [2023-11-24 23:22:44,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2023-11-24 23:22:44,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1033. [2023-11-24 23:22:44,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1027 states have (on average 1.8471275559883156) internal successors, (1897), 1032 states have internal predecessors, (1897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1897 transitions. [2023-11-24 23:22:44,404 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1897 transitions. Word has length 64 [2023-11-24 23:22:44,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:22:44,404 INFO L495 AbstractCegarLoop]: Abstraction has 1033 states and 1897 transitions. [2023-11-24 23:22:44,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.382352941176471) internal successors, (149), 35 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:44,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1897 transitions. [2023-11-24 23:22:44,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-24 23:22:44,406 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:22:44,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:22:44,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 23:22:44,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:22:44,615 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-24 23:22:44,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:22:44,616 INFO L85 PathProgramCache]: Analyzing trace with hash 941680570, now seen corresponding path program 1 times [2023-11-24 23:22:44,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:22:44,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587401084] [2023-11-24 23:22:44,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:22:44,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:22:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:22:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:22:45,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:22:45,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587401084] [2023-11-24 23:22:45,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587401084] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:22:45,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724866399] [2023-11-24 23:22:45,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:22:45,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:22:45,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:22:45,292 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:22:45,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 23:22:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:22:45,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-24 23:22:45,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:22:45,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-24 23:22:45,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 23:22:45,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:22:45,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-24 23:22:45,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-24 23:22:45,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:22:45,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-24 23:22:45,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:22:45,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-24 23:22:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:22:46,013 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:22:46,042 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_533) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) is different from false [2023-11-24 23:22:46,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:22:46,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-11-24 23:22:46,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-11-24 23:22:46,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-24 23:22:46,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-24 23:22:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:22:46,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724866399] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:22:46,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [383478689] [2023-11-24 23:22:46,284 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-24 23:22:46,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:22:46,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 32 [2023-11-24 23:22:46,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134494664] [2023-11-24 23:22:46,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:22:46,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-24 23:22:46,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:22:46,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-24 23:22:46,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=883, Unknown=1, NotChecked=60, Total=1056 [2023-11-24 23:22:46,289 INFO L87 Difference]: Start difference. First operand 1033 states and 1897 transitions. Second operand has 33 states, 32 states have (on average 4.375) internal successors, (140), 33 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:49,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:22:49,087 INFO L93 Difference]: Finished difference Result 1126 states and 2072 transitions. [2023-11-24 23:22:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 23:22:49,091 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.375) internal successors, (140), 33 states have internal predecessors, (140), 0 states have call successors, (0), 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 64 [2023-11-24 23:22:49,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:22:49,098 INFO L225 Difference]: With dead ends: 1126 [2023-11-24 23:22:49,098 INFO L226 Difference]: Without dead ends: 1126 [2023-11-24 23:22:49,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=476, Invalid=2179, Unknown=1, NotChecked=100, Total=2756 [2023-11-24 23:22:49,100 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 945 mSDsluCounter, 2453 mSDsCounter, 0 mSdLazyCounter, 3090 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 2688 SdHoareTripleChecker+Invalid, 3642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 3090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 452 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:22:49,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 2688 Invalid, 3642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 3090 Invalid, 0 Unknown, 452 Unchecked, 2.1s Time] [2023-11-24 23:22:49,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2023-11-24 23:22:49,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1003. [2023-11-24 23:22:49,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 997 states have (on average 1.851554663991976) internal successors, (1846), 1002 states have internal predecessors, (1846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:49,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1846 transitions. [2023-11-24 23:22:49,130 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1846 transitions. Word has length 64 [2023-11-24 23:22:49,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:22:49,130 INFO L495 AbstractCegarLoop]: Abstraction has 1003 states and 1846 transitions. [2023-11-24 23:22:49,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.375) internal successors, (140), 33 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:49,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1846 transitions. [2023-11-24 23:22:49,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-24 23:22:49,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:22:49,133 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-24 23:22:49,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-24 23:22:49,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:22:49,338 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-24 23:22:49,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:22:49,339 INFO L85 PathProgramCache]: Analyzing trace with hash -767136527, now seen corresponding path program 1 times [2023-11-24 23:22:49,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:22:49,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821904108] [2023-11-24 23:22:49,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:22:49,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:22:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 23:22:49,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 23:22:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 23:22:49,496 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-24 23:22:49,496 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 23:22:49,498 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2023-11-24 23:22:49,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2023-11-24 23:22:49,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2023-11-24 23:22:49,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2023-11-24 23:22:49,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2023-11-24 23:22:49,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2023-11-24 23:22:49,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2023-11-24 23:22:49,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2023-11-24 23:22:49,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2023-11-24 23:22:49,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 23:22:49,504 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:22:49,506 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-24 23:22:49,506 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-24 23:22:49,536 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-24 23:22:49,543 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 140 transitions, 296 flow [2023-11-24 23:22:50,268 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 23322 states, 23256 states have (on average 2.8126934984520124) internal successors, (65412), 23321 states have internal predecessors, (65412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:50,270 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 23:22:50,271 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6d0581cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 23:22:50,271 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-24 23:22:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 23322 states, 23256 states have (on average 2.8126934984520124) internal successors, (65412), 23321 states have internal predecessors, (65412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:50,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-24 23:22:50,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:22:50,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:22:50,335 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-24 23:22:50,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:22:50,335 INFO L85 PathProgramCache]: Analyzing trace with hash -2078961544, now seen corresponding path program 1 times [2023-11-24 23:22:50,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:22:50,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453549155] [2023-11-24 23:22:50,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:22:50,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:22:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:22:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:22:50,684 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:22:50,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453549155] [2023-11-24 23:22:50,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453549155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:22:50,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:22:50,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:22:50,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877503507] [2023-11-24 23:22:50,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:22:50,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:22:50,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:22:50,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:22:50,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:22:50,736 INFO L87 Difference]: Start difference. First operand has 23322 states, 23256 states have (on average 2.8126934984520124) internal successors, (65412), 23321 states have internal predecessors, (65412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:22:51,438 INFO L93 Difference]: Finished difference Result 33740 states and 93780 transitions. [2023-11-24 23:22:51,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:22:51,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-24 23:22:51,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:22:51,654 INFO L225 Difference]: With dead ends: 33740 [2023-11-24 23:22:51,654 INFO L226 Difference]: Without dead ends: 32820 [2023-11-24 23:22:51,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:22:51,655 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 208 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:22:51,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 399 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 23:22:51,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32820 states. [2023-11-24 23:22:52,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32820 to 24566. [2023-11-24 23:22:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24566 states, 24506 states have (on average 2.7873990043254713) internal successors, (68308), 24565 states have internal predecessors, (68308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24566 states to 24566 states and 68308 transitions. [2023-11-24 23:22:52,931 INFO L78 Accepts]: Start accepts. Automaton has 24566 states and 68308 transitions. Word has length 30 [2023-11-24 23:22:52,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:22:52,932 INFO L495 AbstractCegarLoop]: Abstraction has 24566 states and 68308 transitions. [2023-11-24 23:22:52,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 24566 states and 68308 transitions. [2023-11-24 23:22:52,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-24 23:22:52,932 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:22:52,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:22:52,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 23:22:52,933 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-24 23:22:52,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:22:52,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1521651250, now seen corresponding path program 1 times [2023-11-24 23:22:52,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:22:52,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252191539] [2023-11-24 23:22:52,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:22:52,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:22:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:22:52,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:22:52,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:22:52,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252191539] [2023-11-24 23:22:52,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252191539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:22:52,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:22:52,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:22:52,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532447064] [2023-11-24 23:22:52,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:22:52,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 23:22:52,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:22:52,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 23:22:52,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:22:52,998 INFO L87 Difference]: Start difference. First operand 24566 states and 68308 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:53,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:22:53,370 INFO L93 Difference]: Finished difference Result 24575 states and 68316 transitions. [2023-11-24 23:22:53,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:22:53,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-11-24 23:22:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:22:53,613 INFO L225 Difference]: With dead ends: 24575 [2023-11-24 23:22:53,613 INFO L226 Difference]: Without dead ends: 24575 [2023-11-24 23:22:53,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:22:53,614 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 48 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:22:53,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 478 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:22:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24575 states. [2023-11-24 23:22:54,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24575 to 24567. [2023-11-24 23:22:54,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24567 states, 24507 states have (on average 2.7873260701024196) internal successors, (68309), 24566 states have internal predecessors, (68309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24567 states to 24567 states and 68309 transitions. [2023-11-24 23:22:54,442 INFO L78 Accepts]: Start accepts. Automaton has 24567 states and 68309 transitions. Word has length 33 [2023-11-24 23:22:54,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:22:54,443 INFO L495 AbstractCegarLoop]: Abstraction has 24567 states and 68309 transitions. [2023-11-24 23:22:54,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:54,443 INFO L276 IsEmpty]: Start isEmpty. Operand 24567 states and 68309 transitions. [2023-11-24 23:22:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-24 23:22:54,446 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:22:54,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:22:54,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 23:22:54,447 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-24 23:22:54,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:22:54,447 INFO L85 PathProgramCache]: Analyzing trace with hash -789065557, now seen corresponding path program 1 times [2023-11-24 23:22:54,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:22:54,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383638054] [2023-11-24 23:22:54,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:22:54,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:22:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:22:54,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:22:54,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:22:54,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383638054] [2023-11-24 23:22:54,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383638054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:22:54,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:22:54,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:22:54,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013913676] [2023-11-24 23:22:54,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:22:54,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:22:54,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:22:54,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:22:54,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:22:54,827 INFO L87 Difference]: Start difference. First operand 24567 states and 68309 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:55,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:22:55,257 INFO L93 Difference]: Finished difference Result 36252 states and 100392 transitions. [2023-11-24 23:22:55,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:22:55,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-24 23:22:55,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:22:55,638 INFO L225 Difference]: With dead ends: 36252 [2023-11-24 23:22:55,638 INFO L226 Difference]: Without dead ends: 35931 [2023-11-24 23:22:55,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:22:55,639 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 258 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:22:55,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 305 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 23:22:55,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35931 states. [2023-11-24 23:22:56,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35931 to 27207. [2023-11-24 23:22:56,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27207 states, 27150 states have (on average 2.7880662983425415) internal successors, (75696), 27206 states have internal predecessors, (75696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:56,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27207 states to 27207 states and 75696 transitions. [2023-11-24 23:22:56,746 INFO L78 Accepts]: Start accepts. Automaton has 27207 states and 75696 transitions. Word has length 34 [2023-11-24 23:22:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:22:56,746 INFO L495 AbstractCegarLoop]: Abstraction has 27207 states and 75696 transitions. [2023-11-24 23:22:56,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 27207 states and 75696 transitions. [2023-11-24 23:22:56,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-24 23:22:56,750 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:22:56,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:22:56,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 23:22:56,751 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-24 23:22:56,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:22:56,752 INFO L85 PathProgramCache]: Analyzing trace with hash -468383767, now seen corresponding path program 1 times [2023-11-24 23:22:56,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:22:56,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318486194] [2023-11-24 23:22:56,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:22:56,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:22:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:22:57,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:22:57,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:22:57,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318486194] [2023-11-24 23:22:57,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318486194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:22:57,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:22:57,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:22:57,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602215647] [2023-11-24 23:22:57,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:22:57,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:22:57,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:22:57,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:22:57,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:22:57,174 INFO L87 Difference]: Start difference. First operand 27207 states and 75696 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:57,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:22:57,752 INFO L93 Difference]: Finished difference Result 35319 states and 98968 transitions. [2023-11-24 23:22:57,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:22:57,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2023-11-24 23:22:57,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:22:57,891 INFO L225 Difference]: With dead ends: 35319 [2023-11-24 23:22:57,891 INFO L226 Difference]: Without dead ends: 34593 [2023-11-24 23:22:57,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:22:57,892 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 276 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:22:57,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 563 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:22:58,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34593 states. [2023-11-24 23:22:58,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34593 to 31653. [2023-11-24 23:22:59,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31653 states, 31596 states have (on average 2.8001645777946575) internal successors, (88474), 31652 states have internal predecessors, (88474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31653 states to 31653 states and 88474 transitions. [2023-11-24 23:22:59,105 INFO L78 Accepts]: Start accepts. Automaton has 31653 states and 88474 transitions. Word has length 51 [2023-11-24 23:22:59,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:22:59,105 INFO L495 AbstractCegarLoop]: Abstraction has 31653 states and 88474 transitions. [2023-11-24 23:22:59,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:22:59,106 INFO L276 IsEmpty]: Start isEmpty. Operand 31653 states and 88474 transitions. [2023-11-24 23:22:59,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-24 23:22:59,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:22:59,108 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:22:59,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 23:22:59,108 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-24 23:22:59,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:22:59,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1394620419, now seen corresponding path program 1 times [2023-11-24 23:22:59,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:22:59,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144024911] [2023-11-24 23:22:59,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:22:59,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:22:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:22:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:22:59,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:22:59,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144024911] [2023-11-24 23:22:59,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144024911] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:22:59,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752501804] [2023-11-24 23:22:59,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:22:59,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:22:59,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:22:59,847 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:22:59,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 23:22:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:22:59,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-24 23:23:00,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:23:00,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-24 23:23:00,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 23:23:00,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-24 23:23:00,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:23:00,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-24 23:23:00,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:23:00,389 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 34 treesize of output 25 [2023-11-24 23:23:00,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:23:00,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-24 23:23:00,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:23:00,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:23:00,443 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_777 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_777) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_777 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_777) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_777 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_777) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false [2023-11-24 23:23:00,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-24 23:23:00,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-24 23:23:00,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752501804] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:23:00,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1037612612] [2023-11-24 23:23:00,807 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-24 23:23:00,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:23:00,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2023-11-24 23:23:00,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247235436] [2023-11-24 23:23:00,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:23:00,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-24 23:23:00,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:23:00,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-24 23:23:00,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=773, Unknown=1, NotChecked=56, Total=930 [2023-11-24 23:23:00,809 INFO L87 Difference]: Start difference. First operand 31653 states and 88474 transitions. Second operand has 31 states, 30 states have (on average 4.433333333333334) internal successors, (133), 31 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:23:04,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:23:04,513 INFO L93 Difference]: Finished difference Result 36617 states and 102714 transitions. [2023-11-24 23:23:04,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-24 23:23:04,515 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.433333333333334) internal successors, (133), 31 states have internal predecessors, (133), 0 states have call successors, (0), 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 61 [2023-11-24 23:23:04,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:23:04,655 INFO L225 Difference]: With dead ends: 36617 [2023-11-24 23:23:04,655 INFO L226 Difference]: Without dead ends: 36437 [2023-11-24 23:23:04,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=657, Invalid=2538, Unknown=1, NotChecked=110, Total=3306 [2023-11-24 23:23:04,657 INFO L413 NwaCegarLoop]: 414 mSDtfsCounter, 1810 mSDsluCounter, 4819 mSDsCounter, 0 mSdLazyCounter, 4079 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1810 SdHoareTripleChecker+Valid, 5233 SdHoareTripleChecker+Invalid, 5037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 4079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 898 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-24 23:23:04,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1810 Valid, 5233 Invalid, 5037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 4079 Invalid, 0 Unknown, 898 Unchecked, 2.7s Time] [2023-11-24 23:23:04,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36437 states. [2023-11-24 23:23:05,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36437 to 32345. [2023-11-24 23:23:05,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32345 states, 32289 states have (on average 2.8031837467868312) internal successors, (90512), 32344 states have internal predecessors, (90512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:23:05,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32345 states to 32345 states and 90512 transitions. [2023-11-24 23:23:05,580 INFO L78 Accepts]: Start accepts. Automaton has 32345 states and 90512 transitions. Word has length 61 [2023-11-24 23:23:05,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:23:05,580 INFO L495 AbstractCegarLoop]: Abstraction has 32345 states and 90512 transitions. [2023-11-24 23:23:05,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.433333333333334) internal successors, (133), 31 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:23:05,581 INFO L276 IsEmpty]: Start isEmpty. Operand 32345 states and 90512 transitions. [2023-11-24 23:23:05,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-24 23:23:05,582 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:23:05,582 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-24 23:23:05,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-24 23:23:05,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-24 23:23:05,789 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-24 23:23:05,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:23:05,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1502800113, now seen corresponding path program 1 times [2023-11-24 23:23:05,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:23:05,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500626535] [2023-11-24 23:23:05,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:23:05,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:23:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:23:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:23:06,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:23:06,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500626535] [2023-11-24 23:23:06,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500626535] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:23:06,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750526034] [2023-11-24 23:23:06,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:23:06,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:23:06,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:23:06,441 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:23:06,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00efed8e-43ed-4a52-b55a-89d92091bedc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-24 23:23:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:23:06,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-24 23:23:06,738 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:23:06,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:23:06,773 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 23:23:06,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-24 23:23:06,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-24 23:23:07,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 23:23:07,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-24 23:23:07,101 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 16 [2023-11-24 23:23:07,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:23:07,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-24 23:23:07,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:23:07,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-24 23:23:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:23:07,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:23:07,259 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_875 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_875) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_875 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_875) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0))) is different from false [2023-11-24 23:23:07,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-24 23:23:07,362 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:23:07,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750526034] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:23:07,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2064042654] [2023-11-24 23:23:07,364 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-24 23:23:07,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:23:07,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 27 [2023-11-24 23:23:07,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952942395] [2023-11-24 23:23:07,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:23:07,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-24 23:23:07,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:23:07,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-24 23:23:07,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=617, Unknown=1, NotChecked=50, Total=756 [2023-11-24 23:23:07,368 INFO L87 Difference]: Start difference. First operand 32345 states and 90512 transitions. Second operand has 28 states, 27 states have (on average 4.0) internal successors, (108), 28 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)