./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 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/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_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ --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-9bd2c7f [2023-11-19 05:05:27,833 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:05:27,948 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DataRace-32bit-Taipan_Default.epf [2023-11-19 05:05:27,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:05:27,957 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:05:27,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:05:27,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:05:27,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:05:27,999 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:05:28,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:05:28,005 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:05:28,006 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:05:28,007 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:05:28,009 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:05:28,009 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:05:28,010 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:05:28,010 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:05:28,011 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:05:28,011 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:05:28,012 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:05:28,014 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:05:28,014 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:05:28,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:05:28,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 05:05:28,017 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:05:28,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:05:28,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:05:28,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:05:28,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 05:05:28,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:05:28,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 05:05:28,021 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-19 05:05:28,021 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 05:05:28,021 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:05:28,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 05:05:28,022 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:05:28,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:05:28,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:05:28,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:05:28,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:05:28,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:05:28,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 05:05:28,024 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:05:28,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:05:28,025 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 05:05:28,025 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:05:28,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:05:28,026 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_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/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_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ 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-19 05:05:28,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:05:28,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:05:28,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:05:28,409 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:05:28,410 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:05:28,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2023-11-19 05:05:31,572 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:05:31,890 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:05:31,891 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2023-11-19 05:05:31,910 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/data/041a8057f/ab01c8e8f8f943bf942bedfc1d41fd69/FLAG6833bc395 [2023-11-19 05:05:31,926 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/data/041a8057f/ab01c8e8f8f943bf942bedfc1d41fd69 [2023-11-19 05:05:31,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:05:31,930 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:05:31,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:05:31,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:05:31,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:05:31,944 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:05:31" (1/1) ... [2023-11-19 05:05:31,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3813a499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:31, skipping insertion in model container [2023-11-19 05:05:31,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:05:31" (1/1) ... [2023-11-19 05:05:31,997 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:05:32,206 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-19 05:05:32,593 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:05:32,605 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:05:32,637 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-19 05:05:32,692 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:05:32,767 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 05:05:32,804 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:05:32,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:32 WrapperNode [2023-11-19 05:05:32,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:05:32,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:05:32,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:05:32,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:05:32,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:32" (1/1) ... [2023-11-19 05:05:32,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:32" (1/1) ... [2023-11-19 05:05:32,916 INFO L138 Inliner]: procedures = 266, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 114 [2023-11-19 05:05:32,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:05:32,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:05:32,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:05:32,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:05:32,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:32" (1/1) ... [2023-11-19 05:05:32,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:32" (1/1) ... [2023-11-19 05:05:32,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:32" (1/1) ... [2023-11-19 05:05:32,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:32" (1/1) ... [2023-11-19 05:05:32,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:32" (1/1) ... [2023-11-19 05:05:32,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:32" (1/1) ... [2023-11-19 05:05:32,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:32" (1/1) ... [2023-11-19 05:05:32,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:32" (1/1) ... [2023-11-19 05:05:32,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:05:32,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:05:32,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:05:32,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:05:32,993 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:32" (1/1) ... [2023-11-19 05:05:33,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:05:33,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:05:33,038 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:05:33,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:05:33,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 05:05:33,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 05:05:33,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:05:33,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 05:05:33,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 05:05:33,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:05:33,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 05:05:33,087 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-19 05:05:33,087 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-19 05:05:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:05:33,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:05:33,089 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 05:05:33,289 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:05:33,291 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:05:33,651 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:05:33,663 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:05:33,667 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 05:05:33,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:05:33 BoogieIcfgContainer [2023-11-19 05:05:33,675 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:05:33,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:05:33,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:05:33,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:05:33,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:05:31" (1/3) ... [2023-11-19 05:05:33,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbbeb0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:05:33, skipping insertion in model container [2023-11-19 05:05:33,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:05:32" (2/3) ... [2023-11-19 05:05:33,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbbeb0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:05:33, skipping insertion in model container [2023-11-19 05:05:33,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:05:33" (3/3) ... [2023-11-19 05:05:33,691 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i [2023-11-19 05:05:33,701 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 05:05:33,713 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:05:33,713 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-19 05:05:33,713 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 05:05:33,814 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-19 05:05:33,850 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 05:05:33,866 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 136 transitions, 279 flow [2023-11-19 05:05:33,869 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 136 transitions, 279 flow [2023-11-19 05:05:33,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 136 transitions, 279 flow [2023-11-19 05:05:34,000 INFO L124 PetriNetUnfolderBase]: 6/219 cut-off events. [2023-11-19 05:05:34,000 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-19 05:05:34,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 219 events. 6/219 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 376 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 108. Up to 4 conditions per place. [2023-11-19 05:05:34,013 INFO L119 LiptonReduction]: Number of co-enabled transitions 2366 [2023-11-19 05:05:39,941 INFO L134 LiptonReduction]: Checked pairs total: 10694 [2023-11-19 05:05:39,943 INFO L136 LiptonReduction]: Total number of compositions: 89 [2023-11-19 05:05:39,954 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 59 transitions, 125 flow [2023-11-19 05:05:40,025 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 440 states, 409 states have (on average 1.8973105134474328) internal successors, (776), 439 states have internal predecessors, (776), 0 states have call successors, (0), 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-19 05:05:40,050 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:05:40,058 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;@7b820399, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:05:40,059 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-11-19 05:05:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 440 states, 409 states have (on average 1.8973105134474328) internal successors, (776), 439 states have internal predecessors, (776), 0 states have call successors, (0), 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-19 05:05:40,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 05:05:40,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:05:40,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 05:05:40,069 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-19 05:05:40,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:05:40,079 INFO L85 PathProgramCache]: Analyzing trace with hash 407366024, now seen corresponding path program 1 times [2023-11-19 05:05:40,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:05:40,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148543609] [2023-11-19 05:05:40,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:05:40,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:05:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:05:40,731 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-19 05:05:40,732 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:05:40,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148543609] [2023-11-19 05:05:40,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148543609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:05:40,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:05:40,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:05:40,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876377926] [2023-11-19 05:05:40,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:05:40,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:05:40,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:05:40,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:05:40,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:05:40,768 INFO L87 Difference]: Start difference. First operand has 440 states, 409 states have (on average 1.8973105134474328) internal successors, (776), 439 states have internal predecessors, (776), 0 states have call successors, (0), 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 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 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-19 05:05:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:05:41,141 INFO L93 Difference]: Finished difference Result 432 states and 747 transitions. [2023-11-19 05:05:41,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:05:41,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-11-19 05:05:41,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:05:41,167 INFO L225 Difference]: With dead ends: 432 [2023-11-19 05:05:41,167 INFO L226 Difference]: Without dead ends: 414 [2023-11-19 05:05:41,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:05:41,173 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:05:41,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 15 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:05:41,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2023-11-19 05:05:41,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 400. [2023-11-19 05:05:41,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 381 states have (on average 1.8608923884514437) internal successors, (709), 399 states have internal predecessors, (709), 0 states have call successors, (0), 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-19 05:05:41,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 709 transitions. [2023-11-19 05:05:41,260 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 709 transitions. Word has length 5 [2023-11-19 05:05:41,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:05:41,260 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 709 transitions. [2023-11-19 05:05:41,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 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-19 05:05:41,261 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 709 transitions. [2023-11-19 05:05:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 05:05:41,261 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:05:41,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 05:05:41,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:05:41,262 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-19 05:05:41,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:05:41,263 INFO L85 PathProgramCache]: Analyzing trace with hash -240797307, now seen corresponding path program 1 times [2023-11-19 05:05:41,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:05:41,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215036332] [2023-11-19 05:05:41,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:05:41,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:05:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:05:41,557 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-19 05:05:41,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:05:41,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215036332] [2023-11-19 05:05:41,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215036332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:05:41,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:05:41,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:05:41,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784646484] [2023-11-19 05:05:41,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:05:41,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:05:41,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:05:41,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:05:41,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:05:41,561 INFO L87 Difference]: Start difference. First operand 400 states and 709 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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-19 05:05:41,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:05:41,809 INFO L93 Difference]: Finished difference Result 378 states and 667 transitions. [2023-11-19 05:05:41,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:05:41,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-11-19 05:05:41,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:05:41,811 INFO L225 Difference]: With dead ends: 378 [2023-11-19 05:05:41,811 INFO L226 Difference]: Without dead ends: 370 [2023-11-19 05:05:41,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:05:41,813 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:05:41,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 11 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:05:41,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2023-11-19 05:05:41,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 367. [2023-11-19 05:05:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 357 states have (on average 1.826330532212885) internal successors, (652), 366 states have internal predecessors, (652), 0 states have call successors, (0), 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-19 05:05:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 652 transitions. [2023-11-19 05:05:41,836 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 652 transitions. Word has length 6 [2023-11-19 05:05:41,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:05:41,837 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 652 transitions. [2023-11-19 05:05:41,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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-19 05:05:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 652 transitions. [2023-11-19 05:05:41,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 05:05:41,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:05:41,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:05:41,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:05:41,839 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-19 05:05:41,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:05:41,840 INFO L85 PathProgramCache]: Analyzing trace with hash -935615675, now seen corresponding path program 1 times [2023-11-19 05:05:41,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:05:41,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509625268] [2023-11-19 05:05:41,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:05:41,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:05:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:05:41,964 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-19 05:05:41,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:05:41,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509625268] [2023-11-19 05:05:41,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509625268] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:05:41,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:05:41,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:05:41,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343121035] [2023-11-19 05:05:41,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:05:41,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:05:41,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:05:41,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:05:41,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:05:41,967 INFO L87 Difference]: Start difference. First operand 367 states and 652 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-19 05:05:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:05:42,060 INFO L93 Difference]: Finished difference Result 368 states and 652 transitions. [2023-11-19 05:05:42,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:05:42,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-11-19 05:05:42,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:05:42,063 INFO L225 Difference]: With dead ends: 368 [2023-11-19 05:05:42,064 INFO L226 Difference]: Without dead ends: 367 [2023-11-19 05:05:42,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:05:42,065 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 28 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:05:42,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 80 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:05:42,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2023-11-19 05:05:42,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2023-11-19 05:05:42,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 357 states have (on average 1.8235294117647058) internal successors, (651), 366 states have internal predecessors, (651), 0 states have call successors, (0), 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-19 05:05:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 651 transitions. [2023-11-19 05:05:42,080 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 651 transitions. Word has length 10 [2023-11-19 05:05:42,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:05:42,080 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 651 transitions. [2023-11-19 05:05:42,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-19 05:05:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 651 transitions. [2023-11-19 05:05:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 05:05:42,081 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:05:42,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:05:42,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:05:42,082 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-19 05:05:42,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:05:42,082 INFO L85 PathProgramCache]: Analyzing trace with hash 927886634, now seen corresponding path program 1 times [2023-11-19 05:05:42,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:05:42,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676300055] [2023-11-19 05:05:42,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:05:42,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:05:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:05:42,376 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-19 05:05:42,376 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:05:42,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676300055] [2023-11-19 05:05:42,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676300055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:05:42,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:05:42,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:05:42,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839158755] [2023-11-19 05:05:42,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:05:42,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:05:42,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:05:42,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:05:42,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:05:42,379 INFO L87 Difference]: Start difference. First operand 367 states and 651 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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-19 05:05:42,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:05:42,601 INFO L93 Difference]: Finished difference Result 388 states and 690 transitions. [2023-11-19 05:05:42,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:05:42,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-11-19 05:05:42,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:05:42,604 INFO L225 Difference]: With dead ends: 388 [2023-11-19 05:05:42,604 INFO L226 Difference]: Without dead ends: 388 [2023-11-19 05:05:42,605 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-19 05:05:42,606 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:05:42,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:05:42,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-11-19 05:05:42,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2023-11-19 05:05:42,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 379 states have (on average 1.8205804749340369) internal successors, (690), 387 states have internal predecessors, (690), 0 states have call successors, (0), 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-19 05:05:42,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 690 transitions. [2023-11-19 05:05:42,620 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 690 transitions. Word has length 11 [2023-11-19 05:05:42,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:05:42,621 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 690 transitions. [2023-11-19 05:05:42,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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-19 05:05:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 690 transitions. [2023-11-19 05:05:42,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-19 05:05:42,623 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:05:42,623 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] [2023-11-19 05:05:42,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 05:05:42,623 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-19 05:05:42,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:05:42,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1492087749, now seen corresponding path program 1 times [2023-11-19 05:05:42,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:05:42,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392597386] [2023-11-19 05:05:42,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:05:42,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:05:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:05:43,114 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-19 05:05:43,114 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:05:43,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392597386] [2023-11-19 05:05:43,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392597386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:05:43,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:05:43,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:05:43,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680223338] [2023-11-19 05:05:43,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:05:43,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:05:43,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:05:43,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:05:43,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:05:43,118 INFO L87 Difference]: Start difference. First operand 388 states and 690 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 05:05:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:05:43,715 INFO L93 Difference]: Finished difference Result 443 states and 776 transitions. [2023-11-19 05:05:43,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:05:43,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2023-11-19 05:05:43,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:05:43,720 INFO L225 Difference]: With dead ends: 443 [2023-11-19 05:05:43,720 INFO L226 Difference]: Without dead ends: 389 [2023-11-19 05:05:43,720 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-19 05:05:43,721 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 42 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 05:05:43,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 40 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 05:05:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2023-11-19 05:05:43,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 370. [2023-11-19 05:05:43,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 364 states have (on average 1.8104395604395604) internal successors, (659), 369 states have internal predecessors, (659), 0 states have call successors, (0), 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-19 05:05:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 659 transitions. [2023-11-19 05:05:43,746 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 659 transitions. Word has length 27 [2023-11-19 05:05:43,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:05:43,746 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 659 transitions. [2023-11-19 05:05:43,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 05:05:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 659 transitions. [2023-11-19 05:05:43,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-19 05:05:43,750 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:05:43,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:05:43,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 05:05:43,753 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-19 05:05:43,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:05:43,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1744530172, now seen corresponding path program 1 times [2023-11-19 05:05:43,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:05:43,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287619337] [2023-11-19 05:05:43,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:05:43,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:05:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:05:44,281 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-19 05:05:44,287 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:05:44,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287619337] [2023-11-19 05:05:44,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287619337] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:05:44,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:05:44,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:05:44,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886001727] [2023-11-19 05:05:44,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:05:44,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:05:44,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:05:44,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:05:44,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:05:44,290 INFO L87 Difference]: Start difference. First operand 370 states and 659 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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-19 05:05:44,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:05:44,458 INFO L93 Difference]: Finished difference Result 362 states and 645 transitions. [2023-11-19 05:05:44,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:05:44,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2023-11-19 05:05:44,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:05:44,461 INFO L225 Difference]: With dead ends: 362 [2023-11-19 05:05:44,461 INFO L226 Difference]: Without dead ends: 283 [2023-11-19 05:05:44,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:05:44,462 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:05:44,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 25 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:05:44,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-11-19 05:05:44,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2023-11-19 05:05:44,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 279 states have (on average 1.8136200716845878) internal successors, (506), 282 states have internal predecessors, (506), 0 states have call successors, (0), 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-19 05:05:44,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 506 transitions. [2023-11-19 05:05:44,475 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 506 transitions. Word has length 31 [2023-11-19 05:05:44,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:05:44,475 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 506 transitions. [2023-11-19 05:05:44,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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-19 05:05:44,475 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 506 transitions. [2023-11-19 05:05:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-19 05:05:44,481 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:05:44,482 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:05:44,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 05:05:44,482 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-19 05:05:44,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:05:44,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1630906881, now seen corresponding path program 1 times [2023-11-19 05:05:44,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:05:44,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870556383] [2023-11-19 05:05:44,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:05:44,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:05:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:05:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:05:47,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:05:47,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870556383] [2023-11-19 05:05:47,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870556383] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:05:47,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676320103] [2023-11-19 05:05:47,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:05:47,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:05:47,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:05:47,657 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:05:47,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:05:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:05:47,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-19 05:05:47,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:05:47,926 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 51 treesize of output 49 [2023-11-19 05:05:48,099 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-19 05:05:48,099 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 42 treesize of output 36 [2023-11-19 05:05:48,489 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-19 05:05:48,489 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 66 [2023-11-19 05:05:48,502 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 20 treesize of output 11 [2023-11-19 05:05:48,515 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 12 treesize of output 8 [2023-11-19 05:05:48,802 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-19 05:05:48,877 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-19 05:05:49,004 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-19 05:05:49,101 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-19 05:05:49,222 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-19 05:05:49,229 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 24 treesize of output 12 [2023-11-19 05:05:49,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:05:49,241 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-19 05:05:49,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:05:49,343 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-19 05:05:49,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:05:49,379 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-19 05:05:49,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:05:49,417 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-19 05:05:49,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:05:49,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:05:49,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:05:49,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:05:49,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:05:49,546 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-19 05:05:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:05:49,561 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:05:49,782 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_381 (Array Int Int)) (v_ArrVal_382 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_381))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_382))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_381 (Array Int Int)) (v_ArrVal_382 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_381))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_382))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_381 (Array Int Int)) (v_ArrVal_382 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_381))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_382))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_381 (Array Int Int)) (v_ArrVal_382 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_381))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_382))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) is different from false [2023-11-19 05:05:49,883 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |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.offset_128| Int)) (or (forall ((v_ArrVal_381 (Array Int Int)) (v_ArrVal_382 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_381))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_128|) v_ArrVal_382))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_128| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_128| Int)) (or (forall ((v_ArrVal_381 (Array Int Int)) (v_ArrVal_382 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_381))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_128|) v_ArrVal_382))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_128| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_128| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_128| .cse3) (forall ((v_ArrVal_381 (Array Int Int)) (v_ArrVal_382 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_381))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_128|) v_ArrVal_382))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_128| Int)) (or (forall ((v_ArrVal_381 (Array Int Int)) (v_ArrVal_382 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_381))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_128|) v_ArrVal_382))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_128| .cse3))))) is different from false [2023-11-19 05:05:50,565 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse4 0))) (.cse5 (select (select |c_#memory_$Pointer$.offset| |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.offset_128| Int)) (or (forall ((v_ArrVal_381 (Array Int Int)) (v_ArrVal_382 Int)) (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_381))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_128|) v_ArrVal_382))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_128| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_128| Int)) (or (forall ((v_ArrVal_381 (Array Int Int)) (v_ArrVal_382 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_381))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_128|) v_ArrVal_382))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_128| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_128| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_128| .cse5) (forall ((v_ArrVal_381 (Array Int Int)) (v_ArrVal_382 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_381))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_128|) v_ArrVal_382))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_128| Int)) (or (forall ((v_ArrVal_381 (Array Int Int)) (v_ArrVal_382 Int)) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_381))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_128|) v_ArrVal_382))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_128| .cse5)))))) is different from false [2023-11-19 05:05:50,636 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 0) .cse10 0) .cse8 0))) (.cse5 (select (select |c_#memory_$Pointer$.offset| |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.offset_128| Int)) (or (forall ((v_ArrVal_381 (Array Int Int)) (v_ArrVal_382 Int)) (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_381))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_128|) v_ArrVal_382))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_128| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_128| Int)) (or (forall ((v_ArrVal_381 (Array Int Int)) (v_ArrVal_382 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_381))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_128|) v_ArrVal_382))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_128| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_128| Int)) (or (forall ((v_ArrVal_381 (Array Int Int)) (v_ArrVal_382 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_381))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_128|) v_ArrVal_382))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_128| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_128| Int)) (or (forall ((v_ArrVal_381 (Array Int Int)) (v_ArrVal_382 Int)) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_381))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_128|) v_ArrVal_382))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_128| .cse5)))))) is different from false [2023-11-19 05:05:50,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:05:50,675 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-19 05:05:50,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:05:50,687 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 248 treesize of output 236 [2023-11-19 05:05:50,701 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 197 treesize of output 181 [2023-11-19 05:05:50,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 31 treesize of output 17 [2023-11-19 05:05:50,750 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 152 treesize of output 130 [2023-11-19 05:05:50,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:05:50,974 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-19 05:05:50,979 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 05:05:50,989 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-19 05:05:50,990 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-19 05:05:51,002 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-19 05:05:51,012 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-19 05:05:51,040 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-19 05:05:51,040 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-19 05:05:51,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:05:51,058 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-19 05:05:51,063 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 05:05:51,073 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-19 05:05:51,074 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-19 05:05:51,087 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-19 05:05:51,097 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-19 05:05:53,742 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 70 treesize of output 62 [2023-11-19 05:05:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-19 05:05:54,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676320103] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:05:54,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1470832946] [2023-11-19 05:05:54,400 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-19 05:05:54,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:05:54,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 47 [2023-11-19 05:05:54,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058291519] [2023-11-19 05:05:54,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:05:54,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-19 05:05:54,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:05:54,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-19 05:05:54,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1775, Unknown=64, NotChecked=356, Total=2352 [2023-11-19 05:05:54,414 INFO L87 Difference]: Start difference. First operand 283 states and 506 transitions. Second operand has 49 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 48 states have internal predecessors, (100), 0 states have call successors, (0), 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-19 05:06:00,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:06:00,026 INFO L93 Difference]: Finished difference Result 371 states and 638 transitions. [2023-11-19 05:06:00,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-19 05:06:00,029 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 48 states have internal predecessors, (100), 0 states have call successors, (0), 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-19 05:06:00,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:06:00,032 INFO L225 Difference]: With dead ends: 371 [2023-11-19 05:06:00,032 INFO L226 Difference]: Without dead ends: 371 [2023-11-19 05:06:00,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=407, Invalid=3204, Unknown=65, NotChecked=484, Total=4160 [2023-11-19 05:06:00,035 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 264 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 1965 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 2671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 530 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:06:00,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 157 Invalid, 2671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1965 Invalid, 0 Unknown, 530 Unchecked, 3.3s Time] [2023-11-19 05:06:00,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2023-11-19 05:06:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 297. [2023-11-19 05:06:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 293 states have (on average 1.8225255972696246) internal successors, (534), 296 states have internal predecessors, (534), 0 states have call successors, (0), 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-19 05:06:00,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 534 transitions. [2023-11-19 05:06:00,050 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 534 transitions. Word has length 34 [2023-11-19 05:06:00,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:06:00,051 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 534 transitions. [2023-11-19 05:06:00,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 48 states have internal predecessors, (100), 0 states have call successors, (0), 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-19 05:06:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 534 transitions. [2023-11-19 05:06:00,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-19 05:06:00,054 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:06:00,055 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:06:00,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-19 05:06:00,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:06:00,280 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-19 05:06:00,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:06:00,281 INFO L85 PathProgramCache]: Analyzing trace with hash 456300757, now seen corresponding path program 2 times [2023-11-19 05:06:00,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:06:00,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656889148] [2023-11-19 05:06:00,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:06:00,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:06:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:06:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:02,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:06:02,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656889148] [2023-11-19 05:06:02,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656889148] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:06:02,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142345756] [2023-11-19 05:06:02,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 05:06:02,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:06:02,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:06:02,123 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:06:02,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 05:06:02,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-19 05:06:02,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:06:02,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-19 05:06:02,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:06:02,472 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-19 05:06:02,472 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-19 05:06:02,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:06:02,864 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-19 05:06:02,894 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-19 05:06:02,894 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-19 05:06:03,262 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-19 05:06:03,363 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-19 05:06:03,490 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-19 05:06:03,609 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-19 05:06:03,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:06:03,623 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-19 05:06:03,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:06:03,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-19 05:06:03,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:06:03,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-19 05:06:03,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:06:03,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-19 05:06:03,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:06:03,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-19 05:06:03,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:06:03,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:06:03,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:06:03,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:06:03,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 35 [2023-11-19 05:06:03,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:06:03,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-19 05:06:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:03,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:06:04,965 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |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.offset_130| Int)) (or (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_548 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_547))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_130|) v_ArrVal_548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_130| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_130| Int)) (or (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_548 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_547))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_130|) v_ArrVal_548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_130| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_130| Int)) (or (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_548 Int)) (= 0 (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_547))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_130|) v_ArrVal_548))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_130| .cse3))))) is different from false [2023-11-19 05:06:05,009 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) (.cse4 (select (select |c_#memory_$Pointer$.offset| |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.offset_130| Int)) (or (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_548 Int)) (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_547))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_130|) v_ArrVal_548))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_130| .cse4))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_130| Int)) (or (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_548 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_547))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_130|) v_ArrVal_548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_130| .cse4))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_130| Int)) (or (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_548 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_547))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_130|) v_ArrVal_548))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_130| .cse4)))))) is different from false [2023-11-19 05:06:05,053 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse6 0))) (.cse4 (select (select |c_#memory_$Pointer$.offset| |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.offset_130| Int)) (or (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_548 Int)) (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_547))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_130|) v_ArrVal_548))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_130| .cse4))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_130| Int)) (or (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_548 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_547))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_130|) v_ArrVal_548))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_130| .cse4))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_130| Int)) (or (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_548 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_547))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ .cse2 |v_ULTIMATE.start_main_#t~mem8#1.offset_130|) v_ArrVal_548))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_130| .cse4)))))) is different from false [2023-11-19 05:06:05,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:06:05,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 64 [2023-11-19 05:06:05,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:06:05,103 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 238 treesize of output 228 [2023-11-19 05:06:05,125 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 197 treesize of output 181 [2023-11-19 05:06:05,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-11-19 05:06:05,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 126 [2023-11-19 05:06:05,300 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-19 05:06:05,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 1 [2023-11-19 05:06:05,315 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-19 05:06:05,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 1 [2023-11-19 05:06:05,882 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-19 05:06:05,890 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-19 05:06:07,997 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_536 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_536) |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_ArrVal_536 (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_536) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false [2023-11-19 05:06:08,048 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_131| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_131|) (forall ((v_ArrVal_536 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_131| v_ArrVal_536) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_131| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_131|) (forall ((v_ArrVal_536 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_131| v_ArrVal_536) |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-19 05:06:08,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-19 05:06:08,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142345756] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:06:08,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [991381955] [2023-11-19 05:06:08,053 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-19 05:06:08,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:06:08,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 44 [2023-11-19 05:06:08,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920247412] [2023-11-19 05:06:08,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:06:08,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-19 05:06:08,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:06:08,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-19 05:06:08,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1477, Unknown=25, NotChecked=410, Total=2070 [2023-11-19 05:06:08,057 INFO L87 Difference]: Start difference. First operand 297 states and 534 transitions. Second operand has 46 states, 45 states have (on average 2.1777777777777776) internal successors, (98), 45 states have internal predecessors, (98), 0 states have call successors, (0), 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-19 05:06:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:06:13,576 INFO L93 Difference]: Finished difference Result 422 states and 733 transitions. [2023-11-19 05:06:13,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-19 05:06:13,577 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.1777777777777776) internal successors, (98), 45 states have internal predecessors, (98), 0 states have call successors, (0), 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-19 05:06:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:06:13,580 INFO L225 Difference]: With dead ends: 422 [2023-11-19 05:06:13,580 INFO L226 Difference]: Without dead ends: 422 [2023-11-19 05:06:13,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=469, Invalid=2946, Unknown=27, NotChecked=590, Total=4032 [2023-11-19 05:06:13,582 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 265 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 768 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-19 05:06:13,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 160 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1713 Invalid, 0 Unknown, 768 Unchecked, 2.9s Time] [2023-11-19 05:06:13,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-11-19 05:06:13,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 309. [2023-11-19 05:06:13,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 305 states have (on average 1.8295081967213114) internal successors, (558), 308 states have internal predecessors, (558), 0 states have call successors, (0), 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-19 05:06:13,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 558 transitions. [2023-11-19 05:06:13,594 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 558 transitions. Word has length 34 [2023-11-19 05:06:13,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:06:13,594 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 558 transitions. [2023-11-19 05:06:13,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.1777777777777776) internal successors, (98), 45 states have internal predecessors, (98), 0 states have call successors, (0), 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-19 05:06:13,595 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 558 transitions. [2023-11-19 05:06:13,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-19 05:06:13,596 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:06:13,596 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:06:13,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-19 05:06:13,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:06:13,812 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-19 05:06:13,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:06:13,813 INFO L85 PathProgramCache]: Analyzing trace with hash 890761153, now seen corresponding path program 3 times [2023-11-19 05:06:13,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:06:13,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360714320] [2023-11-19 05:06:13,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:06:13,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:06:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:06:15,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:06:15,778 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:06:15,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360714320] [2023-11-19 05:06:15,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360714320] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:06:15,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111620861] [2023-11-19 05:06:15,778 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 05:06:15,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:06:15,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:06:15,792 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:06:15,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d6af819-4998-4994-9223-56bf1556bf79/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process