./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62fcddeb-336c-4a8d-a4c0-bfbf903f18e4/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62fcddeb-336c-4a8d-a4c0-bfbf903f18e4/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62fcddeb-336c-4a8d-a4c0-bfbf903f18e4/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62fcddeb-336c-4a8d-a4c0-bfbf903f18e4/bin/utaipan-verify-mE87zJ7Ire/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62fcddeb-336c-4a8d-a4c0-bfbf903f18e4/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62fcddeb-336c-4a8d-a4c0-bfbf903f18e4/bin/utaipan-verify-mE87zJ7Ire --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 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:09:49,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:09:49,430 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62fcddeb-336c-4a8d-a4c0-bfbf903f18e4/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DataRace-32bit-Taipan_Default.epf [2023-11-23 21:09:49,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:09:49,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:09:49,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:09:49,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:09:49,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:09:49,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:09:49,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:09:49,496 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 21:09:49,498 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 21:09:49,498 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 21:09:49,501 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 21:09:49,501 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 21:09:49,502 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 21:09:49,502 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 21:09:49,503 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 21:09:49,504 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 21:09:49,504 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 21:09:49,506 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 21:09:49,507 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 21:09:49,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:09:49,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:09:49,510 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:09:49,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:09:49,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:09:49,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:09:49,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:09:49,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:09:49,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:09:49,515 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-23 21:09:49,516 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 21:09:49,516 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:09:49,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:09:49,517 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:09:49,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:09:49,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:09:49,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:09:49,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:09:49,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:09:49,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:09:49,520 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 21:09:49,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:09:49,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:09:49,522 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:09:49,522 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 21:09:49,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:09:49,523 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_62fcddeb-336c-4a8d-a4c0-bfbf903f18e4/bin/utaipan-verify-mE87zJ7Ire/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_62fcddeb-336c-4a8d-a4c0-bfbf903f18e4/bin/utaipan-verify-mE87zJ7Ire 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 -> 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e [2023-11-23 21:09:49,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:09:49,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:09:49,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:09:49,875 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:09:49,876 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:09:49,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62fcddeb-336c-4a8d-a4c0-bfbf903f18e4/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2023-11-23 21:09:53,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:09:53,617 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:09:53,618 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62fcddeb-336c-4a8d-a4c0-bfbf903f18e4/sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2023-11-23 21:09:53,641 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62fcddeb-336c-4a8d-a4c0-bfbf903f18e4/bin/utaipan-verify-mE87zJ7Ire/data/911512afe/5dc235c7aa414a86aa68ede11dffe87f/FLAGc8a143f89 [2023-11-23 21:09:53,663 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62fcddeb-336c-4a8d-a4c0-bfbf903f18e4/bin/utaipan-verify-mE87zJ7Ire/data/911512afe/5dc235c7aa414a86aa68ede11dffe87f [2023-11-23 21:09:53,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:09:53,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:09:53,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:09:53,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:09:53,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:09:53,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:09:53" (1/1) ... [2023-11-23 21:09:53,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13602c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:09:53, skipping insertion in model container [2023-11-23 21:09:53,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:09:53" (1/1) ... [2023-11-23 21:09:53,765 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:09:54,025 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-23 21:09:54,414 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:09:54,428 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:09:54,445 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-23 21:09:54,506 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:09:54,562 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:09:54,572 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:09:54,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:09:54 WrapperNode [2023-11-23 21:09:54,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:09:54,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:09:54,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:09:54,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:09:54,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:09:54" (1/1) ... [2023-11-23 21:09:54,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:09:54" (1/1) ... [2023-11-23 21:09:54,653 INFO L138 Inliner]: procedures = 266, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 114 [2023-11-23 21:09:54,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:09:54,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:09:54,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:09:54,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:09:54,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:09:54" (1/1) ... [2023-11-23 21:09:54,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:09:54" (1/1) ... [2023-11-23 21:09:54,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:09:54" (1/1) ... [2023-11-23 21:09:54,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:09:54" (1/1) ... [2023-11-23 21:09:54,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:09:54" (1/1) ... [2023-11-23 21:09:54,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:09:54" (1/1) ... [2023-11-23 21:09:54,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:09:54" (1/1) ... [2023-11-23 21:09:54,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:09:54" (1/1) ... [2023-11-23 21:09:54,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:09:54,754 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:09:54,754 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:09:54,755 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:09:54,764 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:09:54" (1/1) ... [2023-11-23 21:09:54,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:09:54,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62fcddeb-336c-4a8d-a4c0-bfbf903f18e4/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:09:54,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62fcddeb-336c-4a8d-a4c0-bfbf903f18e4/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:09:54,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62fcddeb-336c-4a8d-a4c0-bfbf903f18e4/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:09:54,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:09:54,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 21:09:54,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:09:54,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 21:09:54,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 21:09:54,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 21:09:54,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 21:09:54,840 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-23 21:09:54,840 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-23 21:09:54,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:09:54,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:09:54,843 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 21:09:55,006 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:09:55,009 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:09:55,485 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:09:55,504 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:09:55,505 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 21:09:55,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:09:55 BoogieIcfgContainer [2023-11-23 21:09:55,507 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:09:55,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:09:55,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:09:55,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:09:55,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:09:53" (1/3) ... [2023-11-23 21:09:55,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406a7fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:09:55, skipping insertion in model container [2023-11-23 21:09:55,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:09:54" (2/3) ... [2023-11-23 21:09:55,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406a7fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:09:55, skipping insertion in model container [2023-11-23 21:09:55,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:09:55" (3/3) ... [2023-11-23 21:09:55,522 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i [2023-11-23 21:09:55,539 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-23 21:09:55,552 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:09:55,553 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-23 21:09:55,553 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 21:09:55,627 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-23 21:09:55,666 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 135 places, 136 transitions, 279 flow [2023-11-23 21:09:55,778 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1360 states, 1330 states have (on average 1.9157894736842105) internal successors, (2548), 1359 states have internal predecessors, (2548), 0 states have call successors, (0), 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-23 21:09:55,799 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:09:55,812 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;@6ffbe407, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:09:55,812 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-11-23 21:09:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 1360 states, 1330 states have (on average 1.9157894736842105) internal successors, (2548), 1359 states have internal predecessors, (2548), 0 states have call successors, (0), 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-23 21:09:55,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-23 21:09:55,834 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:09:55,835 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-23 21:09:55,835 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-23 21:09:55,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:09:55,845 INFO L85 PathProgramCache]: Analyzing trace with hash 82393490, now seen corresponding path program 1 times [2023-11-23 21:09:55,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:09:55,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414949939] [2023-11-23 21:09:55,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:09:55,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:09:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:09:57,103 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-23 21:09:57,104 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:09:57,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414949939] [2023-11-23 21:09:57,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414949939] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:09:57,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:09:57,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:09:57,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681425473] [2023-11-23 21:09:57,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:09:57,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:09:57,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:09:57,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:09:57,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:09:57,176 INFO L87 Difference]: Start difference. First operand has 1360 states, 1330 states have (on average 1.9157894736842105) internal successors, (2548), 1359 states have internal predecessors, (2548), 0 states have call successors, (0), 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-23 21:09:57,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:09:57,694 INFO L93 Difference]: Finished difference Result 1346 states and 2464 transitions. [2023-11-23 21:09:57,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:09:57,697 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-23 21:09:57,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:09:57,724 INFO L225 Difference]: With dead ends: 1346 [2023-11-23 21:09:57,724 INFO L226 Difference]: Without dead ends: 1233 [2023-11-23 21:09:57,726 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-23 21:09:57,730 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 149 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 21:09:57,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 230 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 21:09:57,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2023-11-23 21:09:57,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1210. [2023-11-23 21:09:57,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 1191 states have (on average 1.874895046179681) internal successors, (2233), 1209 states have internal predecessors, (2233), 0 states have call successors, (0), 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-23 21:09:57,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 2233 transitions. [2023-11-23 21:09:57,854 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 2233 transitions. Word has length 30 [2023-11-23 21:09:57,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:09:57,855 INFO L495 AbstractCegarLoop]: Abstraction has 1210 states and 2233 transitions. [2023-11-23 21:09:57,855 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-23 21:09:57,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 2233 transitions. [2023-11-23 21:09:57,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 21:09:57,857 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:09:57,857 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-23 21:09:57,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:09:57,858 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-23 21:09:57,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:09:57,858 INFO L85 PathProgramCache]: Analyzing trace with hash 213058564, now seen corresponding path program 1 times [2023-11-23 21:09:57,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:09:57,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938556539] [2023-11-23 21:09:57,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:09:57,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:09:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:09:57,997 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-23 21:09:57,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:09:57,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938556539] [2023-11-23 21:09:57,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938556539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:09:57,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:09:57,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:09:58,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240209881] [2023-11-23 21:09:58,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:09:58,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:09:58,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:09:58,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:09:58,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:09:58,003 INFO L87 Difference]: Start difference. First operand 1210 states and 2233 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-23 21:09:58,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:09:58,133 INFO L93 Difference]: Finished difference Result 1219 states and 2241 transitions. [2023-11-23 21:09:58,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:09:58,134 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-23 21:09:58,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:09:58,144 INFO L225 Difference]: With dead ends: 1219 [2023-11-23 21:09:58,145 INFO L226 Difference]: Without dead ends: 1219 [2023-11-23 21:09:58,149 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-23 21:09:58,151 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 61 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:09:58,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 426 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:09:58,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2023-11-23 21:09:58,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1211. [2023-11-23 21:09:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 1192 states have (on average 1.8741610738255035) internal successors, (2234), 1210 states have internal predecessors, (2234), 0 states have call successors, (0), 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-23 21:09:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 2234 transitions. [2023-11-23 21:09:58,200 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 2234 transitions. Word has length 33 [2023-11-23 21:09:58,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:09:58,200 INFO L495 AbstractCegarLoop]: Abstraction has 1211 states and 2234 transitions. [2023-11-23 21:09:58,201 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-23 21:09:58,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 2234 transitions. [2023-11-23 21:09:58,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-23 21:09:58,202 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:09:58,203 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-23 21:09:58,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:09:58,203 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-23 21:09:58,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:09:58,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1682416842, now seen corresponding path program 1 times [2023-11-23 21:09:58,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:09:58,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085159973] [2023-11-23 21:09:58,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:09:58,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:09:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:09:58,644 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-23 21:09:58,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:09:58,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085159973] [2023-11-23 21:09:58,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085159973] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:09:58,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:09:58,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:09:58,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931930680] [2023-11-23 21:09:58,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:09:58,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:09:58,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:09:58,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:09:58,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:09:58,648 INFO L87 Difference]: Start difference. First operand 1211 states and 2234 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-23 21:09:58,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:09:58,940 INFO L93 Difference]: Finished difference Result 1172 states and 2156 transitions. [2023-11-23 21:09:58,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:09:58,940 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-23 21:09:58,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:09:58,949 INFO L225 Difference]: With dead ends: 1172 [2023-11-23 21:09:58,949 INFO L226 Difference]: Without dead ends: 1121 [2023-11-23 21:09:58,949 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-23 21:09:58,951 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 131 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:09:58,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 264 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:09:58,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2023-11-23 21:09:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2023-11-23 21:09:59,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1111 states have (on average 1.8622862286228623) internal successors, (2069), 1120 states have internal predecessors, (2069), 0 states have call successors, (0), 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-23 21:09:59,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 2069 transitions. [2023-11-23 21:09:59,024 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 2069 transitions. Word has length 34 [2023-11-23 21:09:59,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:09:59,025 INFO L495 AbstractCegarLoop]: Abstraction has 1121 states and 2069 transitions. [2023-11-23 21:09:59,025 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-23 21:09:59,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 2069 transitions. [2023-11-23 21:09:59,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-23 21:09:59,027 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:09:59,027 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] [2023-11-23 21:09:59,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:09:59,028 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-23 21:09:59,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:09:59,034 INFO L85 PathProgramCache]: Analyzing trace with hash -899302659, now seen corresponding path program 1 times [2023-11-23 21:09:59,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:09:59,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490111333] [2023-11-23 21:09:59,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:09:59,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:09:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:09:59,421 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-23 21:09:59,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:09:59,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490111333] [2023-11-23 21:09:59,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490111333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:09:59,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:09:59,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:09:59,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811027046] [2023-11-23 21:09:59,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:09:59,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:09:59,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:09:59,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:09:59,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:09:59,425 INFO L87 Difference]: Start difference. First operand 1121 states and 2069 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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-23 21:09:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:09:59,705 INFO L93 Difference]: Finished difference Result 1166 states and 2155 transitions. [2023-11-23 21:09:59,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:09:59,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2023-11-23 21:09:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:09:59,715 INFO L225 Difference]: With dead ends: 1166 [2023-11-23 21:09:59,715 INFO L226 Difference]: Without dead ends: 1166 [2023-11-23 21:09:59,715 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-23 21:09:59,717 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 39 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:09:59,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 293 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:09:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2023-11-23 21:09:59,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1156. [2023-11-23 21:09:59,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1147 states have (on average 1.8622493461203138) internal successors, (2136), 1155 states have internal predecessors, (2136), 0 states have call successors, (0), 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-23 21:09:59,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 2136 transitions. [2023-11-23 21:09:59,765 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 2136 transitions. Word has length 37 [2023-11-23 21:09:59,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:09:59,767 INFO L495 AbstractCegarLoop]: Abstraction has 1156 states and 2136 transitions. [2023-11-23 21:09:59,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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-23 21:09:59,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 2136 transitions. [2023-11-23 21:09:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-23 21:09:59,777 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:09:59,777 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-23 21:09:59,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:09:59,778 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-23 21:09:59,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:09:59,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1880402312, now seen corresponding path program 1 times [2023-11-23 21:09:59,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:09:59,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164510553] [2023-11-23 21:09:59,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:09:59,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:09:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:10:00,306 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-23 21:10:00,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:10:00,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164510553] [2023-11-23 21:10:00,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164510553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:10:00,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:10:00,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:10:00,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935957477] [2023-11-23 21:10:00,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:10:00,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:10:00,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:10:00,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:10:00,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:10:00,310 INFO L87 Difference]: Start difference. First operand 1156 states and 2136 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-23 21:10:01,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:10:01,017 INFO L93 Difference]: Finished difference Result 1326 states and 2440 transitions. [2023-11-23 21:10:01,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:10:01,018 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-23 21:10:01,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:10:01,026 INFO L225 Difference]: With dead ends: 1326 [2023-11-23 21:10:01,026 INFO L226 Difference]: Without dead ends: 1118 [2023-11-23 21:10:01,027 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-23 21:10:01,028 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 237 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 21:10:01,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 545 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 21:10:01,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2023-11-23 21:10:01,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 983. [2023-11-23 21:10:01,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 977 states have (on average 1.8546571136131014) internal successors, (1812), 982 states have internal predecessors, (1812), 0 states have call successors, (0), 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-23 21:10:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1812 transitions. [2023-11-23 21:10:01,064 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1812 transitions. Word has length 63 [2023-11-23 21:10:01,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:10:01,065 INFO L495 AbstractCegarLoop]: Abstraction has 983 states and 1812 transitions. [2023-11-23 21:10:01,065 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-23 21:10:01,065 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1812 transitions. [2023-11-23 21:10:01,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-23 21:10:01,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:10:01,068 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:10:01,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:10:01,069 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-23 21:10:01,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:10:01,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1345881083, now seen corresponding path program 1 times [2023-11-23 21:10:01,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:10:01,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087643804] [2023-11-23 21:10:01,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:10:01,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:10:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:10:01,708 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-23 21:10:01,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:10:01,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087643804] [2023-11-23 21:10:01,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087643804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:10:01,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:10:01,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:10:01,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839162514] [2023-11-23 21:10:01,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:10:01,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:10:01,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:10:01,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:10:01,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:10:01,724 INFO L87 Difference]: Start difference. First operand 983 states and 1812 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 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-23 21:10:01,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:10:01,894 INFO L93 Difference]: Finished difference Result 969 states and 1786 transitions. [2023-11-23 21:10:01,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:10:01,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2023-11-23 21:10:01,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:10:01,903 INFO L225 Difference]: With dead ends: 969 [2023-11-23 21:10:01,903 INFO L226 Difference]: Without dead ends: 743 [2023-11-23 21:10:01,903 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-23 21:10:01,906 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 38 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:10:01,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 246 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:10:01,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2023-11-23 21:10:01,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2023-11-23 21:10:01,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 739 states have (on average 1.851150202976996) internal successors, (1368), 742 states have internal predecessors, (1368), 0 states have call successors, (0), 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-23 21:10:01,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1368 transitions. [2023-11-23 21:10:01,943 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1368 transitions. Word has length 78 [2023-11-23 21:10:01,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:10:01,944 INFO L495 AbstractCegarLoop]: Abstraction has 743 states and 1368 transitions. [2023-11-23 21:10:01,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 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-23 21:10:01,944 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1368 transitions. [2023-11-23 21:10:01,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 21:10:01,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:10:01,947 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:10:01,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 21:10:01,947 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-23 21:10:01,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:10:01,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1958933017, now seen corresponding path program 1 times [2023-11-23 21:10:01,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:10:01,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706118717] [2023-11-23 21:10:01,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:10:01,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:10:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:10:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:10:05,007 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:10:05,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706118717] [2023-11-23 21:10:05,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706118717] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:10:05,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107607738] [2023-11-23 21:10:05,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:10:05,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:10:05,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62fcddeb-336c-4a8d-a4c0-bfbf903f18e4/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:10:05,016 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62fcddeb-336c-4a8d-a4c0-bfbf903f18e4/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:10:05,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62fcddeb-336c-4a8d-a4c0-bfbf903f18e4/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 21:10:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:10:05,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-23 21:10:05,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:10:05,995 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-23 21:10:05,996 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 3 case distinctions, treesize of input 52 treesize of output 44 [2023-11-23 21:10:06,817 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-23 21:10:06,820 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 3 case distinctions, treesize of input 59 treesize of output 49 [2023-11-23 21:10:06,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:10:06,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 21:10:07,505 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-23 21:10:07,672 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-23 21:10:07,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-11-23 21:10:08,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-11-23 21:10:08,986 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 21 treesize of output 13 [2023-11-23 21:10:09,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:10:09,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 39 [2023-11-23 21:10:09,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:10:09,137 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-23 21:10:09,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:10:09,181 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-23 21:10:09,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:10:09,214 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-23 21:10:09,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:10:09,246 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-23 21:10:09,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:10:09,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:10:09,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:10:09,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:10:09,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:10:09,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 47 [2023-11-23 21:10:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:10:09,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:10:09,680 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_371))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_372))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_371))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_372))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_371))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_372))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_371))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_372))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) is different from false [2023-11-23 21:10:13,897 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_371))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_372))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse3))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_19| .cse3) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_371))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_372))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_19| .cse3) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_371))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_372))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_19| .cse3) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_371))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_372))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))))) is different from false [2023-11-23 21:10:14,057 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse1) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_371))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_372))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_371))) (store .cse4 .cse3 (store (select .cse4 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_372))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse1))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_371))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_372))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse1))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse1) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_371))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_372))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0))))) is different from false [2023-11-23 21:10:14,588 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 0))) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_371))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_372))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse5) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_371))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_372))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_371))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_372))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_371))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_372))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse5)))))) is different from false [2023-11-23 21:10:16,270 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse10 0) .cse6 0))) (.cse4 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_371))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_372))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_371))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_372))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse4) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_371))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_372))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_371))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_372))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse4)))))) is different from false [2023-11-23 21:10:16,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:10:16,353 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 4 case distinctions, treesize of input 81 treesize of output 74 [2023-11-23 21:10:16,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:10:16,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 444 treesize of output 416 [2023-11-23 21:10:16,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 174 [2023-11-23 21:10:16,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2023-11-23 21:10:16,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 127 [2023-11-23 21:10:16,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:10:16,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74 [2023-11-23 21:10:16,673 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 21:10:16,698 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-23 21:10:16,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 144 treesize of output 130 [2023-11-23 21:10:16,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2023-11-23 21:10:16,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 62 [2023-11-23 21:10:16,790 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-23 21:10:16,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1 [2023-11-23 21:10:16,805 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-23 21:10:16,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2023-11-23 21:10:22,280 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 65 treesize of output 57 [2023-11-23 21:10:22,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-23 21:10:24,502 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_359 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_359) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_359 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_359) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 1) |c_ULTIMATE.start_main_~#is~0#1.base|))) is different from false [2023-11-23 21:10:24,572 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_14|) (forall ((v_ArrVal_359 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_14| v_ArrVal_359) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 1) |c_ULTIMATE.start_main_~#is~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_14|) (forall ((v_ArrVal_359 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_14| v_ArrVal_359) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) is different from false [2023-11-23 21:10:25,593 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-23 21:10:25,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2023-11-23 21:10:25,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-11-23 21:10:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-23 21:10:25,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107607738] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:10:25,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1164701884] [2023-11-23 21:10:25,941 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-23 21:10:25,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:10:25,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 24] total 67 [2023-11-23 21:10:25,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935689701] [2023-11-23 21:10:25,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:10:25,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-11-23 21:10:25,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:10:25,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-11-23 21:10:25,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=3374, Unknown=64, NotChecked=868, Total=4556 [2023-11-23 21:10:25,953 INFO L87 Difference]: Start difference. First operand 743 states and 1368 transitions. Second operand has 68 states, 67 states have (on average 3.0597014925373136) internal successors, (205), 68 states have internal predecessors, (205), 0 states have call successors, (0), 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-23 21:10:40,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:10:40,401 INFO L93 Difference]: Finished difference Result 1094 states and 2004 transitions. [2023-11-23 21:10:40,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-23 21:10:40,403 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 3.0597014925373136) internal successors, (205), 68 states have internal predecessors, (205), 0 states have call successors, (0), 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 80 [2023-11-23 21:10:40,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:10:40,410 INFO L225 Difference]: With dead ends: 1094 [2023-11-23 21:10:40,410 INFO L226 Difference]: Without dead ends: 1094 [2023-11-23 21:10:40,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 119 SyntacticMatches, 9 SemanticMatches, 99 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 2228 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=932, Invalid=7771, Unknown=67, NotChecked=1330, Total=10100 [2023-11-23 21:10:40,414 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 925 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 2600 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 2496 SdHoareTripleChecker+Invalid, 4480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1776 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-11-23 21:10:40,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 2496 Invalid, 4480 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [104 Valid, 2600 Invalid, 0 Unknown, 1776 Unchecked, 6.8s Time] [2023-11-23 21:10:40,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2023-11-23 21:10:40,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 759. [2023-11-23 21:10:40,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 755 states have (on average 1.8543046357615893) internal successors, (1400), 758 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:10:40,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1400 transitions. [2023-11-23 21:10:40,444 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1400 transitions. Word has length 80 [2023-11-23 21:10:40,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:10:40,444 INFO L495 AbstractCegarLoop]: Abstraction has 759 states and 1400 transitions. [2023-11-23 21:10:40,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 3.0597014925373136) internal successors, (205), 68 states have internal predecessors, (205), 0 states have call successors, (0), 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-23 21:10:40,445 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1400 transitions. [2023-11-23 21:10:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 21:10:40,446 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:10:40,446 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:10:40,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62fcddeb-336c-4a8d-a4c0-bfbf903f18e4/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0