./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_16-arrayloop_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_16-arrayloop_rc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --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 5810bf8f90e8e4e20451fbc06dd5039f754e5765485d12699b814c2e1d4badb7 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 07:45:53,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 07:45:53,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 07:45:53,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 07:45:53,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 07:45:53,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 07:45:53,048 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 07:45:53,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 07:45:53,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 07:45:53,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 07:45:53,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 07:45:53,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 07:45:53,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 07:45:53,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 07:45:53,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 07:45:53,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 07:45:53,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 07:45:53,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 07:45:53,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 07:45:53,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 07:45:53,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 07:45:53,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 07:45:53,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 07:45:53,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 07:45:53,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 07:45:53,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 07:45:53,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 07:45:53,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 07:45:53,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 07:45:53,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 07:45:53,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 07:45:53,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 07:45:53,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 07:45:53,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 07:45:53,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 07:45:53,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 07:45:53,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 07:45:53,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 07:45:53,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 07:45:53,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 07:45:53,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 07:45:53,078 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-12-14 07:45:53,091 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 07:45:53,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 07:45:53,092 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 07:45:53,092 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 07:45:53,092 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 07:45:53,092 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 07:45:53,093 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 07:45:53,093 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 07:45:53,093 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 07:45:53,093 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 07:45:53,093 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 07:45:53,093 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 07:45:53,093 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 07:45:53,093 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 07:45:53,093 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 07:45:53,093 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 07:45:53,094 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 07:45:53,094 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 07:45:53,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 07:45:53,094 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 07:45:53,094 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 07:45:53,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 07:45:53,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 07:45:53,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 07:45:53,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 07:45:53,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 07:45:53,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 07:45:53,095 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-12-14 07:45:53,095 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 07:45:53,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 07:45:53,095 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 07:45:53,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 07:45:53,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 07:45:53,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 07:45:53,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:45:53,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 07:45:53,096 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 07:45:53,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 07:45:53,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 07:45:53,096 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 07:45:53,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 07:45:53,096 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 07:45:53,096 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 07:45:53,096 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/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_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 5810bf8f90e8e4e20451fbc06dd5039f754e5765485d12699b814c2e1d4badb7 [2022-12-14 07:45:53,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 07:45:53,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 07:45:53,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 07:45:53,273 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 07:45:53,273 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 07:45:53,274 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/goblint-regression/09-regions_16-arrayloop_rc.i [2022-12-14 07:45:55,803 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 07:45:56,020 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 07:45:56,020 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/sv-benchmarks/c/goblint-regression/09-regions_16-arrayloop_rc.i [2022-12-14 07:45:56,030 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/data/a69d53367/882c4bb47c584c0ba71c475ad4abaf24/FLAGfbb9adfa5 [2022-12-14 07:45:56,371 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/data/a69d53367/882c4bb47c584c0ba71c475ad4abaf24 [2022-12-14 07:45:56,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 07:45:56,378 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 07:45:56,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 07:45:56,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 07:45:56,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 07:45:56,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:45:56" (1/1) ... [2022-12-14 07:45:56,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43dfa286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:56, skipping insertion in model container [2022-12-14 07:45:56,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:45:56" (1/1) ... [2022-12-14 07:45:56,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 07:45:56,425 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:45:56,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:45:56,788 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 07:45:56,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:45:56,875 INFO L208 MainTranslator]: Completed translation [2022-12-14 07:45:56,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:56 WrapperNode [2022-12-14 07:45:56,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 07:45:56,876 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 07:45:56,876 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 07:45:56,876 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 07:45:56,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:56" (1/1) ... [2022-12-14 07:45:56,902 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:56" (1/1) ... [2022-12-14 07:45:56,927 INFO L138 Inliner]: procedures = 368, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 232 [2022-12-14 07:45:56,927 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 07:45:56,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 07:45:56,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 07:45:56,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 07:45:56,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:56" (1/1) ... [2022-12-14 07:45:56,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:56" (1/1) ... [2022-12-14 07:45:56,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:56" (1/1) ... [2022-12-14 07:45:56,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:56" (1/1) ... [2022-12-14 07:45:56,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:56" (1/1) ... [2022-12-14 07:45:56,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:56" (1/1) ... [2022-12-14 07:45:56,958 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:56" (1/1) ... [2022-12-14 07:45:56,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:56" (1/1) ... [2022-12-14 07:45:56,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 07:45:56,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 07:45:56,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 07:45:56,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 07:45:56,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:56" (1/1) ... [2022-12-14 07:45:56,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:45:56,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:45:56,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 07:45:56,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 07:45:57,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 07:45:57,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 07:45:57,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 07:45:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 07:45:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 07:45:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-14 07:45:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 07:45:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 07:45:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 07:45:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-14 07:45:57,014 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-14 07:45:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 07:45:57,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 07:45:57,016 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 07:45:57,134 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 07:45:57,136 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 07:45:57,497 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 07:45:57,505 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 07:45:57,505 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-14 07:45:57,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:45:57 BoogieIcfgContainer [2022-12-14 07:45:57,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 07:45:57,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 07:45:57,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 07:45:57,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 07:45:57,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:45:56" (1/3) ... [2022-12-14 07:45:57,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655bfb74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:45:57, skipping insertion in model container [2022-12-14 07:45:57,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:56" (2/3) ... [2022-12-14 07:45:57,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655bfb74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:45:57, skipping insertion in model container [2022-12-14 07:45:57,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:45:57" (3/3) ... [2022-12-14 07:45:57,513 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_16-arrayloop_rc.i [2022-12-14 07:45:57,519 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 07:45:57,527 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 07:45:57,527 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-12-14 07:45:57,527 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 07:45:57,578 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 07:45:57,612 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 07:45:57,623 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 267 places, 269 transitions, 543 flow [2022-12-14 07:45:57,625 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 267 places, 269 transitions, 543 flow [2022-12-14 07:45:57,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 269 transitions, 543 flow [2022-12-14 07:45:57,693 INFO L130 PetriNetUnfolder]: 6/268 cut-off events. [2022-12-14 07:45:57,693 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 07:45:57,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 268 events. 6/268 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 426 event pairs, 0 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 200. Up to 2 conditions per place. [2022-12-14 07:45:57,705 INFO L119 LiptonReduction]: Number of co-enabled transitions 19550 [2022-12-14 07:46:30,911 INFO L134 LiptonReduction]: Checked pairs total: 109022 [2022-12-14 07:46:30,911 INFO L136 LiptonReduction]: Total number of compositions: 164 [2022-12-14 07:46:30,917 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 123 places, 122 transitions, 249 flow [2022-12-14 07:46:30,980 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3154 states, 3082 states have (on average 2.04510058403634) internal successors, (6303), 3153 states have internal predecessors, (6303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:30,994 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 07:46:30,998 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=LoopsAndPotentialCycles, 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;@18520308, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 07:46:30,998 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-12-14 07:46:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 3154 states, 3082 states have (on average 2.04510058403634) internal successors, (6303), 3153 states have internal predecessors, (6303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:31,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 07:46:31,008 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:31,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 07:46:31,009 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:46:31,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:31,012 INFO L85 PathProgramCache]: Analyzing trace with hash 26951, now seen corresponding path program 1 times [2022-12-14 07:46:31,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:31,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695246929] [2022-12-14 07:46:31,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:31,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:31,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:46:31,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:31,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695246929] [2022-12-14 07:46:31,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695246929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:46:31,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:46:31,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 07:46:31,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006079224] [2022-12-14 07:46:31,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:46:31,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 07:46:31,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:31,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 07:46:31,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 07:46:31,186 INFO L87 Difference]: Start difference. First operand has 3154 states, 3082 states have (on average 2.04510058403634) internal successors, (6303), 3153 states have internal predecessors, (6303), 0 states have call successors, (0), 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 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:31,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:31,358 INFO L93 Difference]: Finished difference Result 3151 states and 6300 transitions. [2022-12-14 07:46:31,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 07:46:31,361 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-12-14 07:46:31,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:31,385 INFO L225 Difference]: With dead ends: 3151 [2022-12-14 07:46:31,385 INFO L226 Difference]: Without dead ends: 3151 [2022-12-14 07:46:31,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 07:46:31,389 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:31,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:46:31,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2022-12-14 07:46:31,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 3151. [2022-12-14 07:46:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3151 states, 3082 states have (on average 2.044127190136275) internal successors, (6300), 3150 states have internal predecessors, (6300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3151 states to 3151 states and 6300 transitions. [2022-12-14 07:46:31,519 INFO L78 Accepts]: Start accepts. Automaton has 3151 states and 6300 transitions. Word has length 2 [2022-12-14 07:46:31,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:31,520 INFO L495 AbstractCegarLoop]: Abstraction has 3151 states and 6300 transitions. [2022-12-14 07:46:31,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:31,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3151 states and 6300 transitions. [2022-12-14 07:46:31,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 07:46:31,521 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:31,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:31,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 07:46:31,521 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:46:31,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:31,522 INFO L85 PathProgramCache]: Analyzing trace with hash -631640259, now seen corresponding path program 1 times [2022-12-14 07:46:31,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:31,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638095095] [2022-12-14 07:46:31,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:31,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:31,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:46:31,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:31,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638095095] [2022-12-14 07:46:31,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638095095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:46:31,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:46:31,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:46:31,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756887209] [2022-12-14 07:46:31,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:46:31,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:46:31,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:31,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:46:31,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:46:31,628 INFO L87 Difference]: Start difference. First operand 3151 states and 6300 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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) [2022-12-14 07:46:31,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:31,923 INFO L93 Difference]: Finished difference Result 6207 states and 12411 transitions. [2022-12-14 07:46:31,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:46:31,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 [2022-12-14 07:46:31,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:31,954 INFO L225 Difference]: With dead ends: 6207 [2022-12-14 07:46:31,954 INFO L226 Difference]: Without dead ends: 6207 [2022-12-14 07:46:31,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:46:31,955 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 111 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:31,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 158 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:46:31,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6207 states. [2022-12-14 07:46:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6207 to 3198. [2022-12-14 07:46:32,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3198 states, 3129 states have (on average 2.043464365612017) internal successors, (6394), 3197 states have internal predecessors, (6394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 3198 states and 6394 transitions. [2022-12-14 07:46:32,025 INFO L78 Accepts]: Start accepts. Automaton has 3198 states and 6394 transitions. Word has length 11 [2022-12-14 07:46:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:32,025 INFO L495 AbstractCegarLoop]: Abstraction has 3198 states and 6394 transitions. [2022-12-14 07:46:32,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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) [2022-12-14 07:46:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 6394 transitions. [2022-12-14 07:46:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 07:46:32,026 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:32,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:32,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 07:46:32,026 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:46:32,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:32,027 INFO L85 PathProgramCache]: Analyzing trace with hash 988069114, now seen corresponding path program 1 times [2022-12-14 07:46:32,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:32,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340185800] [2022-12-14 07:46:32,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:32,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:46:32,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:32,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340185800] [2022-12-14 07:46:32,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340185800] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:46:32,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970089461] [2022-12-14 07:46:32,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:32,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:32,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:46:32,121 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:46:32,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 07:46:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:32,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:46:32,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:46:32,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:46:32,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:46:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:46:32,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970089461] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:46:32,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2083945970] [2022-12-14 07:46:32,283 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 07:46:32,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:46:32,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-14 07:46:32,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41395743] [2022-12-14 07:46:32,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:46:32,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 07:46:32,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:32,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 07:46:32,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 07:46:32,286 INFO L87 Difference]: Start difference. First operand 3198 states and 6394 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:32,964 INFO L93 Difference]: Finished difference Result 12367 states and 24728 transitions. [2022-12-14 07:46:32,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:46:32,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 12 [2022-12-14 07:46:32,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:33,002 INFO L225 Difference]: With dead ends: 12367 [2022-12-14 07:46:33,002 INFO L226 Difference]: Without dead ends: 12367 [2022-12-14 07:46:33,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 07:46:33,004 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 666 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:33,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 440 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 07:46:33,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12367 states. [2022-12-14 07:46:33,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12367 to 10929. [2022-12-14 07:46:33,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10929 states, 10860 states have (on average 2.1420810313075505) internal successors, (23263), 10928 states have internal predecessors, (23263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:33,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10929 states to 10929 states and 23263 transitions. [2022-12-14 07:46:33,187 INFO L78 Accepts]: Start accepts. Automaton has 10929 states and 23263 transitions. Word has length 12 [2022-12-14 07:46:33,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:33,188 INFO L495 AbstractCegarLoop]: Abstraction has 10929 states and 23263 transitions. [2022-12-14 07:46:33,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:33,188 INFO L276 IsEmpty]: Start isEmpty. Operand 10929 states and 23263 transitions. [2022-12-14 07:46:33,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 07:46:33,189 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:33,189 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:33,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 07:46:33,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-14 07:46:33,390 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:46:33,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:33,391 INFO L85 PathProgramCache]: Analyzing trace with hash 226358909, now seen corresponding path program 2 times [2022-12-14 07:46:33,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:33,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396933663] [2022-12-14 07:46:33,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:33,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:33,761 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:46:33,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:33,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396933663] [2022-12-14 07:46:33,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396933663] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:46:33,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362079252] [2022-12-14 07:46:33,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:46:33,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:33,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:46:33,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:46:33,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 07:46:33,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 07:46:33,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:46:33,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 07:46:33,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:46:33,899 INFO L350 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 [2022-12-14 07:46:33,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:33,922 INFO L350 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 [2022-12-14 07:46:33,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:33,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:33,961 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:46:33,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-12-14 07:46:33,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:34,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:34,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:34,003 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:46:34,003 INFO L350 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 39 treesize of output 44 [2022-12-14 07:46:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 07:46:34,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:46:34,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362079252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:46:34,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 07:46:34,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2022-12-14 07:46:34,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571754323] [2022-12-14 07:46:34,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:46:34,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 07:46:34,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:34,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 07:46:34,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-12-14 07:46:34,027 INFO L87 Difference]: Start difference. First operand 10929 states and 23263 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:34,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:34,937 INFO L93 Difference]: Finished difference Result 11652 states and 24718 transitions. [2022-12-14 07:46:34,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 07:46:34,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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 15 [2022-12-14 07:46:34,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:34,970 INFO L225 Difference]: With dead ends: 11652 [2022-12-14 07:46:34,970 INFO L226 Difference]: Without dead ends: 11652 [2022-12-14 07:46:34,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-12-14 07:46:34,971 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 206 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:34,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 80 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 07:46:34,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11652 states. [2022-12-14 07:46:35,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11652 to 11652. [2022-12-14 07:46:35,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11652 states, 11583 states have (on average 2.1339894673228006) internal successors, (24718), 11651 states have internal predecessors, (24718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11652 states to 11652 states and 24718 transitions. [2022-12-14 07:46:35,206 INFO L78 Accepts]: Start accepts. Automaton has 11652 states and 24718 transitions. Word has length 15 [2022-12-14 07:46:35,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:35,206 INFO L495 AbstractCegarLoop]: Abstraction has 11652 states and 24718 transitions. [2022-12-14 07:46:35,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:35,207 INFO L276 IsEmpty]: Start isEmpty. Operand 11652 states and 24718 transitions. [2022-12-14 07:46:35,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 07:46:35,208 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:35,208 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:35,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 07:46:35,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:35,409 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:46:35,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:35,409 INFO L85 PathProgramCache]: Analyzing trace with hash -2023439612, now seen corresponding path program 1 times [2022-12-14 07:46:35,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:35,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869072360] [2022-12-14 07:46:35,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:35,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:46:35,626 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:35,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869072360] [2022-12-14 07:46:35,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869072360] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:46:35,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108065096] [2022-12-14 07:46:35,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:35,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:35,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:46:35,627 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:46:35,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 07:46:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:35,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 07:46:35,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:46:35,817 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:46:35,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:46:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:46:35,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108065096] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:46:35,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2049053780] [2022-12-14 07:46:35,871 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 07:46:35,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:46:35,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-14 07:46:35,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153460179] [2022-12-14 07:46:35,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:46:35,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 07:46:35,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:35,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 07:46:35,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-14 07:46:35,873 INFO L87 Difference]: Start difference. First operand 11652 states and 24718 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:37,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:37,061 INFO L93 Difference]: Finished difference Result 32533 states and 65054 transitions. [2022-12-14 07:46:37,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 07:46:37,062 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 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 16 [2022-12-14 07:46:37,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:37,117 INFO L225 Difference]: With dead ends: 32533 [2022-12-14 07:46:37,117 INFO L226 Difference]: Without dead ends: 32533 [2022-12-14 07:46:37,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-14 07:46:37,118 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 2220 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2220 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:37,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2220 Valid, 854 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 07:46:37,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32533 states. [2022-12-14 07:46:37,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32533 to 28194. [2022-12-14 07:46:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28194 states, 28125 states have (on average 2.1558755555555558) internal successors, (60634), 28193 states have internal predecessors, (60634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:37,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28194 states to 28194 states and 60634 transitions. [2022-12-14 07:46:37,554 INFO L78 Accepts]: Start accepts. Automaton has 28194 states and 60634 transitions. Word has length 16 [2022-12-14 07:46:37,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:37,554 INFO L495 AbstractCegarLoop]: Abstraction has 28194 states and 60634 transitions. [2022-12-14 07:46:37,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:37,554 INFO L276 IsEmpty]: Start isEmpty. Operand 28194 states and 60634 transitions. [2022-12-14 07:46:37,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 07:46:37,554 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:37,555 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:37,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-14 07:46:37,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:37,756 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:46:37,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:37,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1704058844, now seen corresponding path program 2 times [2022-12-14 07:46:37,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:37,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060467748] [2022-12-14 07:46:37,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:37,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:38,738 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:46:38,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:38,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060467748] [2022-12-14 07:46:38,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060467748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:46:38,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:46:38,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:46:38,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976385249] [2022-12-14 07:46:38,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:46:38,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:46:38,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:38,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:46:38,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:46:38,740 INFO L87 Difference]: Start difference. First operand 28194 states and 60634 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:39,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:39,574 INFO L93 Difference]: Finished difference Result 30452 states and 65474 transitions. [2022-12-14 07:46:39,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:46:39,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 22 [2022-12-14 07:46:39,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:39,634 INFO L225 Difference]: With dead ends: 30452 [2022-12-14 07:46:39,634 INFO L226 Difference]: Without dead ends: 30452 [2022-12-14 07:46:39,634 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 [2022-12-14 07:46:39,635 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 124 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:39,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 91 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 07:46:39,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30452 states. [2022-12-14 07:46:39,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30452 to 30452. [2022-12-14 07:46:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30452 states, 30383 states have (on average 2.1549550735608727) internal successors, (65474), 30451 states have internal predecessors, (65474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:40,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30452 states to 30452 states and 65474 transitions. [2022-12-14 07:46:40,068 INFO L78 Accepts]: Start accepts. Automaton has 30452 states and 65474 transitions. Word has length 22 [2022-12-14 07:46:40,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:40,068 INFO L495 AbstractCegarLoop]: Abstraction has 30452 states and 65474 transitions. [2022-12-14 07:46:40,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 30452 states and 65474 transitions. [2022-12-14 07:46:40,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 07:46:40,069 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:40,069 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:40,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 07:46:40,070 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:46:40,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:40,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1424437340, now seen corresponding path program 1 times [2022-12-14 07:46:40,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:40,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999226031] [2022-12-14 07:46:40,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:40,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:41,095 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:46:41,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:41,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999226031] [2022-12-14 07:46:41,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999226031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:46:41,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:46:41,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 07:46:41,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719299480] [2022-12-14 07:46:41,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:46:41,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 07:46:41,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:41,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 07:46:41,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:46:41,097 INFO L87 Difference]: Start difference. First operand 30452 states and 65474 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:42,377 INFO L93 Difference]: Finished difference Result 61310 states and 132126 transitions. [2022-12-14 07:46:42,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 07:46:42,378 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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 26 [2022-12-14 07:46:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:42,486 INFO L225 Difference]: With dead ends: 61310 [2022-12-14 07:46:42,486 INFO L226 Difference]: Without dead ends: 61310 [2022-12-14 07:46:42,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-12-14 07:46:42,487 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 433 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:42,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 301 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 07:46:42,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61310 states. [2022-12-14 07:46:42,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61310 to 31272. [2022-12-14 07:46:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31272 states, 31203 states have (on average 2.152164855943339) internal successors, (67154), 31271 states have internal predecessors, (67154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31272 states to 31272 states and 67154 transitions. [2022-12-14 07:46:43,059 INFO L78 Accepts]: Start accepts. Automaton has 31272 states and 67154 transitions. Word has length 26 [2022-12-14 07:46:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:43,060 INFO L495 AbstractCegarLoop]: Abstraction has 31272 states and 67154 transitions. [2022-12-14 07:46:43,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:43,060 INFO L276 IsEmpty]: Start isEmpty. Operand 31272 states and 67154 transitions. [2022-12-14 07:46:43,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 07:46:43,060 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:43,061 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:43,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 07:46:43,061 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:46:43,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:43,061 INFO L85 PathProgramCache]: Analyzing trace with hash -255933461, now seen corresponding path program 1 times [2022-12-14 07:46:43,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:43,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273532680] [2022-12-14 07:46:43,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:43,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:46:43,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:43,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273532680] [2022-12-14 07:46:43,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273532680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:46:43,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:46:43,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 07:46:43,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271956673] [2022-12-14 07:46:43,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:46:43,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 07:46:43,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:43,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 07:46:43,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:46:43,827 INFO L87 Difference]: Start difference. First operand 31272 states and 67154 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:45,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:45,104 INFO L93 Difference]: Finished difference Result 61164 states and 131865 transitions. [2022-12-14 07:46:45,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 07:46:45,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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 26 [2022-12-14 07:46:45,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:45,214 INFO L225 Difference]: With dead ends: 61164 [2022-12-14 07:46:45,214 INFO L226 Difference]: Without dead ends: 61164 [2022-12-14 07:46:45,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2022-12-14 07:46:45,215 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 595 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:45,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 304 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 07:46:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61164 states. [2022-12-14 07:46:45,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61164 to 31556. [2022-12-14 07:46:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31556 states, 31487 states have (on average 2.150665353955601) internal successors, (67718), 31555 states have internal predecessors, (67718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31556 states to 31556 states and 67718 transitions. [2022-12-14 07:46:45,909 INFO L78 Accepts]: Start accepts. Automaton has 31556 states and 67718 transitions. Word has length 26 [2022-12-14 07:46:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:45,910 INFO L495 AbstractCegarLoop]: Abstraction has 31556 states and 67718 transitions. [2022-12-14 07:46:45,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:45,910 INFO L276 IsEmpty]: Start isEmpty. Operand 31556 states and 67718 transitions. [2022-12-14 07:46:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 07:46:45,911 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:45,911 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:45,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 07:46:45,911 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:46:45,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:45,912 INFO L85 PathProgramCache]: Analyzing trace with hash 167319396, now seen corresponding path program 2 times [2022-12-14 07:46:45,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:45,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437774327] [2022-12-14 07:46:45,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:45,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:46:46,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:46,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437774327] [2022-12-14 07:46:46,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437774327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:46:46,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:46:46,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 07:46:46,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028773145] [2022-12-14 07:46:46,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:46:46,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 07:46:46,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:46,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 07:46:46,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:46:46,803 INFO L87 Difference]: Start difference. First operand 31556 states and 67718 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:48,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:48,559 INFO L93 Difference]: Finished difference Result 60186 states and 129267 transitions. [2022-12-14 07:46:48,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 07:46:48,560 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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 26 [2022-12-14 07:46:48,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:48,665 INFO L225 Difference]: With dead ends: 60186 [2022-12-14 07:46:48,665 INFO L226 Difference]: Without dead ends: 60186 [2022-12-14 07:46:48,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2022-12-14 07:46:48,666 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 395 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:48,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 232 Invalid, 1767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1729 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-14 07:46:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60186 states. [2022-12-14 07:46:49,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60186 to 32132. [2022-12-14 07:46:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32132 states, 32063 states have (on average 2.1530736362785765) internal successors, (69034), 32131 states have internal predecessors, (69034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32132 states to 32132 states and 69034 transitions. [2022-12-14 07:46:49,247 INFO L78 Accepts]: Start accepts. Automaton has 32132 states and 69034 transitions. Word has length 26 [2022-12-14 07:46:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:49,247 INFO L495 AbstractCegarLoop]: Abstraction has 32132 states and 69034 transitions. [2022-12-14 07:46:49,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 32132 states and 69034 transitions. [2022-12-14 07:46:49,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 07:46:49,248 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:49,248 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:49,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 07:46:49,248 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:46:49,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:49,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1335823275, now seen corresponding path program 2 times [2022-12-14 07:46:49,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:49,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797078951] [2022-12-14 07:46:49,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:49,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:46:49,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:49,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797078951] [2022-12-14 07:46:49,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797078951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:46:49,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:46:49,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 07:46:49,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209988192] [2022-12-14 07:46:49,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:46:49,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 07:46:49,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:49,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 07:46:49,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:46:49,924 INFO L87 Difference]: Start difference. First operand 32132 states and 69034 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:51,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:51,864 INFO L93 Difference]: Finished difference Result 59968 states and 128849 transitions. [2022-12-14 07:46:51,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 07:46:51,865 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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 26 [2022-12-14 07:46:51,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:51,970 INFO L225 Difference]: With dead ends: 59968 [2022-12-14 07:46:51,970 INFO L226 Difference]: Without dead ends: 59968 [2022-12-14 07:46:51,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2022-12-14 07:46:51,971 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 474 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2117 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:51,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 249 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2117 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 07:46:52,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59968 states. [2022-12-14 07:46:52,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59968 to 31377. [2022-12-14 07:46:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31377 states, 31309 states have (on average 2.1550991727618256) internal successors, (67474), 31376 states have internal predecessors, (67474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:52,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31377 states to 31377 states and 67474 transitions. [2022-12-14 07:46:52,651 INFO L78 Accepts]: Start accepts. Automaton has 31377 states and 67474 transitions. Word has length 26 [2022-12-14 07:46:52,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:52,651 INFO L495 AbstractCegarLoop]: Abstraction has 31377 states and 67474 transitions. [2022-12-14 07:46:52,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:52,652 INFO L276 IsEmpty]: Start isEmpty. Operand 31377 states and 67474 transitions. [2022-12-14 07:46:52,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 07:46:52,652 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:52,652 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:52,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 07:46:52,653 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:46:52,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:52,653 INFO L85 PathProgramCache]: Analyzing trace with hash -105484828, now seen corresponding path program 3 times [2022-12-14 07:46:52,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:52,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321529059] [2022-12-14 07:46:52,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:52,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:46:53,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:53,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321529059] [2022-12-14 07:46:53,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321529059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:46:53,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:46:53,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 07:46:53,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060324863] [2022-12-14 07:46:53,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:46:53,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 07:46:53,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:53,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 07:46:53,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:46:53,498 INFO L87 Difference]: Start difference. First operand 31377 states and 67474 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:54,385 INFO L93 Difference]: Finished difference Result 34074 states and 72985 transitions. [2022-12-14 07:46:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 07:46:54,385 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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 26 [2022-12-14 07:46:54,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:54,438 INFO L225 Difference]: With dead ends: 34074 [2022-12-14 07:46:54,438 INFO L226 Difference]: Without dead ends: 34074 [2022-12-14 07:46:54,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-12-14 07:46:54,439 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 159 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:54,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 108 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 07:46:54,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34074 states. [2022-12-14 07:46:54,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34074 to 31357. [2022-12-14 07:46:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31357 states, 31289 states have (on average 2.1551983125059926) internal successors, (67434), 31356 states have internal predecessors, (67434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31357 states to 31357 states and 67434 transitions. [2022-12-14 07:46:54,872 INFO L78 Accepts]: Start accepts. Automaton has 31357 states and 67434 transitions. Word has length 26 [2022-12-14 07:46:54,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:54,872 INFO L495 AbstractCegarLoop]: Abstraction has 31357 states and 67434 transitions. [2022-12-14 07:46:54,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 31357 states and 67434 transitions. [2022-12-14 07:46:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 07:46:54,873 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:54,873 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:54,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 07:46:54,873 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:46:54,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:54,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2125479808, now seen corresponding path program 4 times [2022-12-14 07:46:54,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:54,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379488883] [2022-12-14 07:46:54,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:54,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:46:55,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:55,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379488883] [2022-12-14 07:46:55,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379488883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:46:55,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:46:55,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 07:46:55,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361073715] [2022-12-14 07:46:55,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:46:55,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 07:46:55,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:55,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 07:46:55,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:46:55,556 INFO L87 Difference]: Start difference. First operand 31357 states and 67434 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:56,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:56,572 INFO L93 Difference]: Finished difference Result 33474 states and 71785 transitions. [2022-12-14 07:46:56,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 07:46:56,572 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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 26 [2022-12-14 07:46:56,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:56,625 INFO L225 Difference]: With dead ends: 33474 [2022-12-14 07:46:56,625 INFO L226 Difference]: Without dead ends: 33474 [2022-12-14 07:46:56,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-12-14 07:46:56,626 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 182 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:56,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 112 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 07:46:56,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33474 states. [2022-12-14 07:46:56,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33474 to 31337. [2022-12-14 07:46:56,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31337 states, 31269 states have (on average 2.155297579071924) internal successors, (67394), 31336 states have internal predecessors, (67394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31337 states to 31337 states and 67394 transitions. [2022-12-14 07:46:57,046 INFO L78 Accepts]: Start accepts. Automaton has 31337 states and 67394 transitions. Word has length 26 [2022-12-14 07:46:57,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:57,046 INFO L495 AbstractCegarLoop]: Abstraction has 31337 states and 67394 transitions. [2022-12-14 07:46:57,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:57,046 INFO L276 IsEmpty]: Start isEmpty. Operand 31337 states and 67394 transitions. [2022-12-14 07:46:57,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 07:46:57,046 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:57,046 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:57,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 07:46:57,047 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:46:57,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:57,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2042359396, now seen corresponding path program 5 times [2022-12-14 07:46:57,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:57,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730838025] [2022-12-14 07:46:57,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:57,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:57,703 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:46:57,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:57,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730838025] [2022-12-14 07:46:57,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730838025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:46:57,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:46:57,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 07:46:57,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198842215] [2022-12-14 07:46:57,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:46:57,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 07:46:57,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:57,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 07:46:57,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:46:57,705 INFO L87 Difference]: Start difference. First operand 31337 states and 67394 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:58,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:58,985 INFO L93 Difference]: Finished difference Result 32561 states and 69842 transitions. [2022-12-14 07:46:58,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 07:46:58,985 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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 26 [2022-12-14 07:46:58,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:59,037 INFO L225 Difference]: With dead ends: 32561 [2022-12-14 07:46:59,038 INFO L226 Difference]: Without dead ends: 32561 [2022-12-14 07:46:59,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-12-14 07:46:59,038 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 212 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:59,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 119 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 07:46:59,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32561 states. [2022-12-14 07:46:59,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32561 to 30357. [2022-12-14 07:46:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30357 states, 30289 states have (on average 2.153719171976625) internal successors, (65234), 30356 states have internal predecessors, (65234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:59,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30357 states to 30357 states and 65234 transitions. [2022-12-14 07:46:59,466 INFO L78 Accepts]: Start accepts. Automaton has 30357 states and 65234 transitions. Word has length 26 [2022-12-14 07:46:59,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:59,466 INFO L495 AbstractCegarLoop]: Abstraction has 30357 states and 65234 transitions. [2022-12-14 07:46:59,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:46:59,466 INFO L276 IsEmpty]: Start isEmpty. Operand 30357 states and 65234 transitions. [2022-12-14 07:46:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 07:46:59,466 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:59,466 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:59,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 07:46:59,467 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:46:59,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:59,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1113371605, now seen corresponding path program 1 times [2022-12-14 07:46:59,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:59,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871571027] [2022-12-14 07:46:59,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:59,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:46:59,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:59,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871571027] [2022-12-14 07:46:59,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871571027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:46:59,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:46:59,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:46:59,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316628199] [2022-12-14 07:46:59,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:46:59,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:46:59,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:59,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:46:59,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:46:59,981 INFO L87 Difference]: Start difference. First operand 30357 states and 65234 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:00,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:00,769 INFO L93 Difference]: Finished difference Result 32263 states and 69065 transitions. [2022-12-14 07:47:00,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:47:00,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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 [2022-12-14 07:47:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:00,819 INFO L225 Difference]: With dead ends: 32263 [2022-12-14 07:47:00,819 INFO L226 Difference]: Without dead ends: 32263 [2022-12-14 07:47:00,819 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 [2022-12-14 07:47:00,819 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:00,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 89 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 07:47:00,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32263 states. [2022-12-14 07:47:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32263 to 32263. [2022-12-14 07:47:01,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32263 states, 32195 states have (on average 2.1452088833669825) internal successors, (69065), 32262 states have internal predecessors, (69065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32263 states to 32263 states and 69065 transitions. [2022-12-14 07:47:01,378 INFO L78 Accepts]: Start accepts. Automaton has 32263 states and 69065 transitions. Word has length 27 [2022-12-14 07:47:01,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:01,379 INFO L495 AbstractCegarLoop]: Abstraction has 32263 states and 69065 transitions. [2022-12-14 07:47:01,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 32263 states and 69065 transitions. [2022-12-14 07:47:01,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 07:47:01,379 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:01,380 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:01,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 07:47:01,380 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:01,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:01,381 INFO L85 PathProgramCache]: Analyzing trace with hash 782083252, now seen corresponding path program 1 times [2022-12-14 07:47:01,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:01,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024325214] [2022-12-14 07:47:01,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:01,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:01,975 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:47:01,975 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:01,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024325214] [2022-12-14 07:47:01,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024325214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:47:01,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:47:01,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:47:01,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88539181] [2022-12-14 07:47:01,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:47:01,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:47:01,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:47:01,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:47:01,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:47:01,976 INFO L87 Difference]: Start difference. First operand 32263 states and 69065 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:02,792 INFO L93 Difference]: Finished difference Result 34631 states and 74125 transitions. [2022-12-14 07:47:02,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:47:02,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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 28 [2022-12-14 07:47:02,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:02,845 INFO L225 Difference]: With dead ends: 34631 [2022-12-14 07:47:02,845 INFO L226 Difference]: Without dead ends: 34631 [2022-12-14 07:47:02,845 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 [2022-12-14 07:47:02,846 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 124 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:02,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 94 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 07:47:02,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34631 states. [2022-12-14 07:47:03,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34631 to 34631. [2022-12-14 07:47:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34631 states, 34563 states have (on average 2.1446344356682) internal successors, (74125), 34630 states have internal predecessors, (74125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:03,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34631 states to 34631 states and 74125 transitions. [2022-12-14 07:47:03,284 INFO L78 Accepts]: Start accepts. Automaton has 34631 states and 74125 transitions. Word has length 28 [2022-12-14 07:47:03,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:03,284 INFO L495 AbstractCegarLoop]: Abstraction has 34631 states and 74125 transitions. [2022-12-14 07:47:03,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:03,285 INFO L276 IsEmpty]: Start isEmpty. Operand 34631 states and 74125 transitions. [2022-12-14 07:47:03,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 07:47:03,285 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:03,285 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:03,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 07:47:03,285 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:03,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:03,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1551891616, now seen corresponding path program 1 times [2022-12-14 07:47:03,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:03,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84870346] [2022-12-14 07:47:03,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:03,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:03,963 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:47:03,963 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:03,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84870346] [2022-12-14 07:47:03,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84870346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:47:03,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:47:03,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 07:47:03,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214435728] [2022-12-14 07:47:03,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:47:03,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 07:47:03,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:47:03,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 07:47:03,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:47:03,964 INFO L87 Difference]: Start difference. First operand 34631 states and 74125 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:05,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:05,203 INFO L93 Difference]: Finished difference Result 68157 states and 146172 transitions. [2022-12-14 07:47:05,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 07:47:05,204 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 32 [2022-12-14 07:47:05,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:05,325 INFO L225 Difference]: With dead ends: 68157 [2022-12-14 07:47:05,325 INFO L226 Difference]: Without dead ends: 68157 [2022-12-14 07:47:05,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-12-14 07:47:05,326 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 427 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:05,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 299 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 07:47:05,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68157 states. [2022-12-14 07:47:05,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68157 to 36143. [2022-12-14 07:47:05,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36143 states, 36076 states have (on average 2.1376261226300035) internal successors, (77117), 36142 states have internal predecessors, (77117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36143 states to 36143 states and 77117 transitions. [2022-12-14 07:47:05,992 INFO L78 Accepts]: Start accepts. Automaton has 36143 states and 77117 transitions. Word has length 32 [2022-12-14 07:47:05,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:05,992 INFO L495 AbstractCegarLoop]: Abstraction has 36143 states and 77117 transitions. [2022-12-14 07:47:05,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:05,992 INFO L276 IsEmpty]: Start isEmpty. Operand 36143 states and 77117 transitions. [2022-12-14 07:47:05,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 07:47:05,993 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:05,993 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:05,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 07:47:05,994 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:05,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:05,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2052914331, now seen corresponding path program 1 times [2022-12-14 07:47:05,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:05,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331795466] [2022-12-14 07:47:05,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:05,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:06,704 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:47:06,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:06,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331795466] [2022-12-14 07:47:06,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331795466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:47:06,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:47:06,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 07:47:06,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794065540] [2022-12-14 07:47:06,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:47:06,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 07:47:06,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:47:06,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 07:47:06,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:47:06,706 INFO L87 Difference]: Start difference. First operand 36143 states and 77117 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:08,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:08,566 INFO L93 Difference]: Finished difference Result 67903 states and 145664 transitions. [2022-12-14 07:47:08,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 07:47:08,567 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 32 [2022-12-14 07:47:08,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:08,686 INFO L225 Difference]: With dead ends: 67903 [2022-12-14 07:47:08,687 INFO L226 Difference]: Without dead ends: 67903 [2022-12-14 07:47:08,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2022-12-14 07:47:08,687 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 550 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 2322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:08,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 322 Invalid, 2322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-14 07:47:08,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67903 states. [2022-12-14 07:47:09,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67903 to 36193. [2022-12-14 07:47:09,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36193 states, 36126 states have (on average 2.137435641919947) internal successors, (77217), 36192 states have internal predecessors, (77217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36193 states to 36193 states and 77217 transitions. [2022-12-14 07:47:09,486 INFO L78 Accepts]: Start accepts. Automaton has 36193 states and 77217 transitions. Word has length 32 [2022-12-14 07:47:09,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:09,486 INFO L495 AbstractCegarLoop]: Abstraction has 36193 states and 77217 transitions. [2022-12-14 07:47:09,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:09,486 INFO L276 IsEmpty]: Start isEmpty. Operand 36193 states and 77217 transitions. [2022-12-14 07:47:09,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 07:47:09,487 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:09,487 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:09,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 07:47:09,487 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:09,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:09,488 INFO L85 PathProgramCache]: Analyzing trace with hash -512001248, now seen corresponding path program 2 times [2022-12-14 07:47:09,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:09,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243862017] [2022-12-14 07:47:09,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:09,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:10,158 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:47:10,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:10,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243862017] [2022-12-14 07:47:10,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243862017] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:47:10,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:47:10,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 07:47:10,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116608555] [2022-12-14 07:47:10,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:47:10,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 07:47:10,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:47:10,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 07:47:10,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:47:10,159 INFO L87 Difference]: Start difference. First operand 36193 states and 77217 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:11,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:11,592 INFO L93 Difference]: Finished difference Result 66893 states and 143055 transitions. [2022-12-14 07:47:11,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 07:47:11,593 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 32 [2022-12-14 07:47:11,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:11,709 INFO L225 Difference]: With dead ends: 66893 [2022-12-14 07:47:11,709 INFO L226 Difference]: Without dead ends: 66893 [2022-12-14 07:47:11,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2022-12-14 07:47:11,710 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 382 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:11,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 228 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1477 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 07:47:11,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66893 states. [2022-12-14 07:47:12,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66893 to 39539. [2022-12-14 07:47:12,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39539 states, 39472 states have (on average 2.1507144304823673) internal successors, (84893), 39538 states have internal predecessors, (84893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39539 states to 39539 states and 84893 transitions. [2022-12-14 07:47:12,369 INFO L78 Accepts]: Start accepts. Automaton has 39539 states and 84893 transitions. Word has length 32 [2022-12-14 07:47:12,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:12,369 INFO L495 AbstractCegarLoop]: Abstraction has 39539 states and 84893 transitions. [2022-12-14 07:47:12,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:12,369 INFO L276 IsEmpty]: Start isEmpty. Operand 39539 states and 84893 transitions. [2022-12-14 07:47:12,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 07:47:12,370 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:12,370 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:12,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 07:47:12,370 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:12,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:12,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1202162597, now seen corresponding path program 2 times [2022-12-14 07:47:12,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:12,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762274728] [2022-12-14 07:47:12,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:12,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:47:13,067 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:13,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762274728] [2022-12-14 07:47:13,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762274728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:47:13,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:47:13,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 07:47:13,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878061568] [2022-12-14 07:47:13,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:47:13,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 07:47:13,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:47:13,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 07:47:13,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:47:13,068 INFO L87 Difference]: Start difference. First operand 39539 states and 84893 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:14,707 INFO L93 Difference]: Finished difference Result 66681 states and 142613 transitions. [2022-12-14 07:47:14,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 07:47:14,707 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 32 [2022-12-14 07:47:14,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:14,825 INFO L225 Difference]: With dead ends: 66681 [2022-12-14 07:47:14,825 INFO L226 Difference]: Without dead ends: 66681 [2022-12-14 07:47:14,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2022-12-14 07:47:14,826 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 456 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 1776 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 1825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:14,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 253 Invalid, 1825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1776 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 07:47:14,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66681 states. [2022-12-14 07:47:15,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66681 to 38593. [2022-12-14 07:47:15,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38593 states, 38528 states have (on average 2.150565822259136) internal successors, (82857), 38592 states have internal predecessors, (82857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38593 states to 38593 states and 82857 transitions. [2022-12-14 07:47:15,529 INFO L78 Accepts]: Start accepts. Automaton has 38593 states and 82857 transitions. Word has length 32 [2022-12-14 07:47:15,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:15,529 INFO L495 AbstractCegarLoop]: Abstraction has 38593 states and 82857 transitions. [2022-12-14 07:47:15,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 38593 states and 82857 transitions. [2022-12-14 07:47:15,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 07:47:15,530 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:15,530 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:15,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 07:47:15,530 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:15,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:15,531 INFO L85 PathProgramCache]: Analyzing trace with hash 411594336, now seen corresponding path program 3 times [2022-12-14 07:47:15,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:15,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757476469] [2022-12-14 07:47:15,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:15,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:47:16,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:16,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757476469] [2022-12-14 07:47:16,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757476469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:47:16,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:47:16,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 07:47:16,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999131489] [2022-12-14 07:47:16,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:47:16,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 07:47:16,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:47:16,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 07:47:16,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:47:16,231 INFO L87 Difference]: Start difference. First operand 38593 states and 82857 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:17,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:17,509 INFO L93 Difference]: Finished difference Result 41253 states and 88285 transitions. [2022-12-14 07:47:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 07:47:17,509 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 32 [2022-12-14 07:47:17,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:17,584 INFO L225 Difference]: With dead ends: 41253 [2022-12-14 07:47:17,584 INFO L226 Difference]: Without dead ends: 41253 [2022-12-14 07:47:17,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-12-14 07:47:17,585 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 158 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:17,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 116 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 07:47:17,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41253 states. [2022-12-14 07:47:18,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41253 to 38573. [2022-12-14 07:47:18,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38573 states, 38508 states have (on average 2.1506440220213983) internal successors, (82817), 38572 states have internal predecessors, (82817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38573 states to 38573 states and 82817 transitions. [2022-12-14 07:47:18,266 INFO L78 Accepts]: Start accepts. Automaton has 38573 states and 82817 transitions. Word has length 32 [2022-12-14 07:47:18,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:18,266 INFO L495 AbstractCegarLoop]: Abstraction has 38573 states and 82817 transitions. [2022-12-14 07:47:18,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:18,266 INFO L276 IsEmpty]: Start isEmpty. Operand 38573 states and 82817 transitions. [2022-12-14 07:47:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 07:47:18,267 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:18,267 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:18,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 07:47:18,267 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:18,268 INFO L85 PathProgramCache]: Analyzing trace with hash 357615100, now seen corresponding path program 4 times [2022-12-14 07:47:18,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:18,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968292960] [2022-12-14 07:47:18,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:18,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:47:18,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:18,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968292960] [2022-12-14 07:47:18,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968292960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:47:18,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:47:18,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 07:47:18,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435115937] [2022-12-14 07:47:18,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:47:18,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 07:47:18,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:47:18,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 07:47:18,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:47:18,931 INFO L87 Difference]: Start difference. First operand 38573 states and 82817 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:20,088 INFO L93 Difference]: Finished difference Result 40693 states and 87165 transitions. [2022-12-14 07:47:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 07:47:20,089 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 32 [2022-12-14 07:47:20,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:20,150 INFO L225 Difference]: With dead ends: 40693 [2022-12-14 07:47:20,150 INFO L226 Difference]: Without dead ends: 40693 [2022-12-14 07:47:20,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-12-14 07:47:20,151 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 166 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:20,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 115 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 07:47:20,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40693 states. [2022-12-14 07:47:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40693 to 38553. [2022-12-14 07:47:20,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38553 states, 38488 states have (on average 2.1507223030554976) internal successors, (82777), 38552 states have internal predecessors, (82777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38553 states to 38553 states and 82777 transitions. [2022-12-14 07:47:20,660 INFO L78 Accepts]: Start accepts. Automaton has 38553 states and 82777 transitions. Word has length 32 [2022-12-14 07:47:20,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:20,660 INFO L495 AbstractCegarLoop]: Abstraction has 38553 states and 82777 transitions. [2022-12-14 07:47:20,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:20,660 INFO L276 IsEmpty]: Start isEmpty. Operand 38553 states and 82777 transitions. [2022-12-14 07:47:20,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 07:47:20,661 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:20,661 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:20,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 07:47:20,661 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:20,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:20,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1103876128, now seen corresponding path program 5 times [2022-12-14 07:47:20,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:20,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182410565] [2022-12-14 07:47:20,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:20,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:21,329 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:47:21,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:21,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182410565] [2022-12-14 07:47:21,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182410565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:47:21,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:47:21,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 07:47:21,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222300328] [2022-12-14 07:47:21,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:47:21,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 07:47:21,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:47:21,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 07:47:21,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:47:21,331 INFO L87 Difference]: Start difference. First operand 38553 states and 82777 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:22,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:22,794 INFO L93 Difference]: Finished difference Result 39841 states and 85353 transitions. [2022-12-14 07:47:22,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 07:47:22,795 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 32 [2022-12-14 07:47:22,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:22,854 INFO L225 Difference]: With dead ends: 39841 [2022-12-14 07:47:22,854 INFO L226 Difference]: Without dead ends: 39841 [2022-12-14 07:47:22,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-12-14 07:47:22,855 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 203 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:22,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 125 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 07:47:22,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39841 states. [2022-12-14 07:47:23,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39841 to 34233. [2022-12-14 07:47:23,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34233 states, 34168 states have (on average 2.1425602903301333) internal successors, (73207), 34232 states have internal predecessors, (73207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34233 states to 34233 states and 73207 transitions. [2022-12-14 07:47:23,322 INFO L78 Accepts]: Start accepts. Automaton has 34233 states and 73207 transitions. Word has length 32 [2022-12-14 07:47:23,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:23,322 INFO L495 AbstractCegarLoop]: Abstraction has 34233 states and 73207 transitions. [2022-12-14 07:47:23,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:23,322 INFO L276 IsEmpty]: Start isEmpty. Operand 34233 states and 73207 transitions. [2022-12-14 07:47:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 07:47:23,322 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:23,323 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:23,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 07:47:23,323 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:23,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:23,323 INFO L85 PathProgramCache]: Analyzing trace with hash -717484333, now seen corresponding path program 1 times [2022-12-14 07:47:23,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:23,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728560335] [2022-12-14 07:47:23,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:23,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:23,860 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:47:23,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:23,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728560335] [2022-12-14 07:47:23,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728560335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:47:23,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:47:23,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:47:23,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11329151] [2022-12-14 07:47:23,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:47:23,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:47:23,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:47:23,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:47:23,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:47:23,861 INFO L87 Difference]: Start difference. First operand 34233 states and 73207 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:24,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:24,723 INFO L93 Difference]: Finished difference Result 47648 states and 101495 transitions. [2022-12-14 07:47:24,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:47:24,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-12-14 07:47:24,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:24,800 INFO L225 Difference]: With dead ends: 47648 [2022-12-14 07:47:24,800 INFO L226 Difference]: Without dead ends: 47648 [2022-12-14 07:47:24,800 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 [2022-12-14 07:47:24,801 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 116 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:24,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 65 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 07:47:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47648 states. [2022-12-14 07:47:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47648 to 37799. [2022-12-14 07:47:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37799 states, 37734 states have (on average 2.130518895425876) internal successors, (80393), 37798 states have internal predecessors, (80393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:25,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37799 states to 37799 states and 80393 transitions. [2022-12-14 07:47:25,354 INFO L78 Accepts]: Start accepts. Automaton has 37799 states and 80393 transitions. Word has length 33 [2022-12-14 07:47:25,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:25,354 INFO L495 AbstractCegarLoop]: Abstraction has 37799 states and 80393 transitions. [2022-12-14 07:47:25,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:25,355 INFO L276 IsEmpty]: Start isEmpty. Operand 37799 states and 80393 transitions. [2022-12-14 07:47:25,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 07:47:25,355 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:25,355 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:25,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 07:47:25,355 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:25,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:25,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1306092195, now seen corresponding path program 1 times [2022-12-14 07:47:25,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:25,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182973197] [2022-12-14 07:47:25,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:25,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:47:25,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:25,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182973197] [2022-12-14 07:47:25,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182973197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:47:25,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:47:25,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:47:25,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481276414] [2022-12-14 07:47:25,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:47:25,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:47:25,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:47:25,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:47:25,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:47:25,890 INFO L87 Difference]: Start difference. First operand 37799 states and 80393 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:26,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:26,825 INFO L93 Difference]: Finished difference Result 45171 states and 95938 transitions. [2022-12-14 07:47:26,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:47:26,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 [2022-12-14 07:47:26,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:26,896 INFO L225 Difference]: With dead ends: 45171 [2022-12-14 07:47:26,896 INFO L226 Difference]: Without dead ends: 45171 [2022-12-14 07:47:26,896 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 [2022-12-14 07:47:26,896 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 134 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:26,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 88 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 07:47:26,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45171 states. [2022-12-14 07:47:27,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45171 to 39957. [2022-12-14 07:47:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39957 states, 39894 states have (on average 2.1292174261793755) internal successors, (84943), 39956 states have internal predecessors, (84943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39957 states to 39957 states and 84943 transitions. [2022-12-14 07:47:27,477 INFO L78 Accepts]: Start accepts. Automaton has 39957 states and 84943 transitions. Word has length 34 [2022-12-14 07:47:27,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:27,477 INFO L495 AbstractCegarLoop]: Abstraction has 39957 states and 84943 transitions. [2022-12-14 07:47:27,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 39957 states and 84943 transitions. [2022-12-14 07:47:27,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 07:47:27,478 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:27,479 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:27,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 07:47:27,479 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:27,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:27,479 INFO L85 PathProgramCache]: Analyzing trace with hash 541728011, now seen corresponding path program 1 times [2022-12-14 07:47:27,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:27,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598048646] [2022-12-14 07:47:27,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:27,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 07:47:29,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:29,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598048646] [2022-12-14 07:47:29,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598048646] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:47:29,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857790523] [2022-12-14 07:47:29,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:29,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:47:29,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:47:29,645 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:47:29,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 07:47:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:30,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 1334 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 07:47:30,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:47:30,156 INFO L350 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 [2022-12-14 07:47:30,195 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:47:30,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:47:30,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857790523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:47:30,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 07:47:30,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 15 [2022-12-14 07:47:30,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032118033] [2022-12-14 07:47:30,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:47:30,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:47:30,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:47:30,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:47:30,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-12-14 07:47:30,196 INFO L87 Difference]: Start difference. First operand 39957 states and 84943 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:30,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:30,658 INFO L93 Difference]: Finished difference Result 72027 states and 152546 transitions. [2022-12-14 07:47:30,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:47:30,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 38 [2022-12-14 07:47:30,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:30,785 INFO L225 Difference]: With dead ends: 72027 [2022-12-14 07:47:30,785 INFO L226 Difference]: Without dead ends: 72027 [2022-12-14 07:47:30,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-12-14 07:47:30,786 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 258 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:30,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 282 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:47:30,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72027 states. [2022-12-14 07:47:31,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72027 to 39998. [2022-12-14 07:47:31,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39998 states, 39932 states have (on average 2.128217970549935) internal successors, (84984), 39997 states have internal predecessors, (84984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39998 states to 39998 states and 84984 transitions. [2022-12-14 07:47:31,518 INFO L78 Accepts]: Start accepts. Automaton has 39998 states and 84984 transitions. Word has length 38 [2022-12-14 07:47:31,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:31,518 INFO L495 AbstractCegarLoop]: Abstraction has 39998 states and 84984 transitions. [2022-12-14 07:47:31,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:31,518 INFO L276 IsEmpty]: Start isEmpty. Operand 39998 states and 84984 transitions. [2022-12-14 07:47:31,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 07:47:31,519 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:31,519 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:31,527 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 07:47:31,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-14 07:47:31,721 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:31,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:31,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1223956197, now seen corresponding path program 2 times [2022-12-14 07:47:31,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:31,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96748317] [2022-12-14 07:47:31,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:31,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:33,855 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 07:47:33,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:33,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96748317] [2022-12-14 07:47:33,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96748317] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:47:33,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088969932] [2022-12-14 07:47:33,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:47:33,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:47:33,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:47:33,857 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:47:33,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 07:47:34,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 07:47:34,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:47:34,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 07:47:34,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:47:34,314 INFO L350 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 [2022-12-14 07:47:34,343 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:47:34,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:47:34,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088969932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:47:34,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 07:47:34,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 15 [2022-12-14 07:47:34,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841906975] [2022-12-14 07:47:34,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:47:34,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:47:34,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:47:34,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:47:34,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-12-14 07:47:34,344 INFO L87 Difference]: Start difference. First operand 39998 states and 84984 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:34,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:34,609 INFO L93 Difference]: Finished difference Result 36284 states and 76895 transitions. [2022-12-14 07:47:34,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:47:34,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 38 [2022-12-14 07:47:34,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:34,667 INFO L225 Difference]: With dead ends: 36284 [2022-12-14 07:47:34,667 INFO L226 Difference]: Without dead ends: 36284 [2022-12-14 07:47:34,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-12-14 07:47:34,668 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 315 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:34,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 211 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:47:34,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36284 states. [2022-12-14 07:47:35,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36284 to 36182. [2022-12-14 07:47:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36182 states, 36116 states have (on average 2.1262875179975635) internal successors, (76793), 36181 states have internal predecessors, (76793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36182 states to 36182 states and 76793 transitions. [2022-12-14 07:47:35,135 INFO L78 Accepts]: Start accepts. Automaton has 36182 states and 76793 transitions. Word has length 38 [2022-12-14 07:47:35,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:35,136 INFO L495 AbstractCegarLoop]: Abstraction has 36182 states and 76793 transitions. [2022-12-14 07:47:35,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 36182 states and 76793 transitions. [2022-12-14 07:47:35,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 07:47:35,136 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:35,136 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:35,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 07:47:35,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:47:35,338 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:35,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:35,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1367218123, now seen corresponding path program 1 times [2022-12-14 07:47:35,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:35,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436017783] [2022-12-14 07:47:35,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:35,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:47:36,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:36,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436017783] [2022-12-14 07:47:36,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436017783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:47:36,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:47:36,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:47:36,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480913040] [2022-12-14 07:47:36,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:47:36,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:47:36,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:47:36,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:47:36,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:47:36,023 INFO L87 Difference]: Start difference. First operand 36182 states and 76793 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:36,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:36,928 INFO L93 Difference]: Finished difference Result 38646 states and 81721 transitions. [2022-12-14 07:47:36,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:47:36,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-12-14 07:47:36,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:36,986 INFO L225 Difference]: With dead ends: 38646 [2022-12-14 07:47:36,986 INFO L226 Difference]: Without dead ends: 38646 [2022-12-14 07:47:36,986 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 [2022-12-14 07:47:36,987 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 96 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:36,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 89 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 07:47:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38646 states. [2022-12-14 07:47:37,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38646 to 37744. [2022-12-14 07:47:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37744 states, 37679 states have (on average 2.1205711404230474) internal successors, (79901), 37743 states have internal predecessors, (79901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:37,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37744 states to 37744 states and 79901 transitions. [2022-12-14 07:47:37,478 INFO L78 Accepts]: Start accepts. Automaton has 37744 states and 79901 transitions. Word has length 39 [2022-12-14 07:47:37,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:37,478 INFO L495 AbstractCegarLoop]: Abstraction has 37744 states and 79901 transitions. [2022-12-14 07:47:37,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:37,478 INFO L276 IsEmpty]: Start isEmpty. Operand 37744 states and 79901 transitions. [2022-12-14 07:47:37,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 07:47:37,479 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:37,479 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:37,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-14 07:47:37,479 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:37,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:37,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1992872882, now seen corresponding path program 1 times [2022-12-14 07:47:37,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:37,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296212088] [2022-12-14 07:47:37,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:37,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:38,028 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:47:38,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:38,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296212088] [2022-12-14 07:47:38,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296212088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:47:38,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:47:38,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:47:38,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842417646] [2022-12-14 07:47:38,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:47:38,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:47:38,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:47:38,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:47:38,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:47:38,030 INFO L87 Difference]: Start difference. First operand 37744 states and 79901 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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) [2022-12-14 07:47:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:38,910 INFO L93 Difference]: Finished difference Result 40772 states and 86222 transitions. [2022-12-14 07:47:38,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:47:38,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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 40 [2022-12-14 07:47:38,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:38,973 INFO L225 Difference]: With dead ends: 40772 [2022-12-14 07:47:38,973 INFO L226 Difference]: Without dead ends: 40772 [2022-12-14 07:47:38,973 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 [2022-12-14 07:47:38,974 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 130 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:38,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 89 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 07:47:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40772 states. [2022-12-14 07:47:39,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40772 to 39646. [2022-12-14 07:47:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39646 states, 39585 states have (on average 2.1188328912466843) internal successors, (83874), 39645 states have internal predecessors, (83874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:39,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39646 states to 39646 states and 83874 transitions. [2022-12-14 07:47:39,517 INFO L78 Accepts]: Start accepts. Automaton has 39646 states and 83874 transitions. Word has length 40 [2022-12-14 07:47:39,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:39,517 INFO L495 AbstractCegarLoop]: Abstraction has 39646 states and 83874 transitions. [2022-12-14 07:47:39,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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) [2022-12-14 07:47:39,517 INFO L276 IsEmpty]: Start isEmpty. Operand 39646 states and 83874 transitions. [2022-12-14 07:47:39,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 07:47:39,518 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:39,518 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:39,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-14 07:47:39,518 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:39,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:39,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1979139190, now seen corresponding path program 1 times [2022-12-14 07:47:39,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:39,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512163051] [2022-12-14 07:47:39,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:39,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:47:40,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:40,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512163051] [2022-12-14 07:47:40,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512163051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:47:40,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:47:40,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:47:40,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915833465] [2022-12-14 07:47:40,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:47:40,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:47:40,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:47:40,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:47:40,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:47:40,088 INFO L87 Difference]: Start difference. First operand 39646 states and 83874 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:40,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:40,622 INFO L93 Difference]: Finished difference Result 41231 states and 87068 transitions. [2022-12-14 07:47:40,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:47:40,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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 45 [2022-12-14 07:47:40,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:40,686 INFO L225 Difference]: With dead ends: 41231 [2022-12-14 07:47:40,686 INFO L226 Difference]: Without dead ends: 41231 [2022-12-14 07:47:40,687 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 [2022-12-14 07:47:40,687 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:40,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 82 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:47:40,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41231 states. [2022-12-14 07:47:41,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41231 to 41231. [2022-12-14 07:47:41,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41231 states, 41170 states have (on average 2.114840903570561) internal successors, (87068), 41230 states have internal predecessors, (87068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41231 states to 41231 states and 87068 transitions. [2022-12-14 07:47:41,258 INFO L78 Accepts]: Start accepts. Automaton has 41231 states and 87068 transitions. Word has length 45 [2022-12-14 07:47:41,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:41,258 INFO L495 AbstractCegarLoop]: Abstraction has 41231 states and 87068 transitions. [2022-12-14 07:47:41,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:41,258 INFO L276 IsEmpty]: Start isEmpty. Operand 41231 states and 87068 transitions. [2022-12-14 07:47:41,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 07:47:41,259 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:41,259 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:41,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-14 07:47:41,259 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:41,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:41,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1519521751, now seen corresponding path program 1 times [2022-12-14 07:47:41,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:41,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649926730] [2022-12-14 07:47:41,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:41,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:47:41,816 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:41,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649926730] [2022-12-14 07:47:41,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649926730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:47:41,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:47:41,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:47:41,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16166285] [2022-12-14 07:47:41,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:47:41,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:47:41,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:47:41,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:47:41,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:47:41,817 INFO L87 Difference]: Start difference. First operand 41231 states and 87068 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:42,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:42,657 INFO L93 Difference]: Finished difference Result 43894 states and 92755 transitions. [2022-12-14 07:47:42,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:47:42,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-12-14 07:47:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:42,726 INFO L225 Difference]: With dead ends: 43894 [2022-12-14 07:47:42,726 INFO L226 Difference]: Without dead ends: 43894 [2022-12-14 07:47:42,726 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 [2022-12-14 07:47:42,726 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 127 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:42,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 89 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 07:47:42,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43894 states. [2022-12-14 07:47:43,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43894 to 43220. [2022-12-14 07:47:43,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43220 states, 43160 states have (on average 2.1161955514365154) internal successors, (91335), 43219 states have internal predecessors, (91335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43220 states to 43220 states and 91335 transitions. [2022-12-14 07:47:43,346 INFO L78 Accepts]: Start accepts. Automaton has 43220 states and 91335 transitions. Word has length 46 [2022-12-14 07:47:43,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:43,346 INFO L495 AbstractCegarLoop]: Abstraction has 43220 states and 91335 transitions. [2022-12-14 07:47:43,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:43,346 INFO L276 IsEmpty]: Start isEmpty. Operand 43220 states and 91335 transitions. [2022-12-14 07:47:43,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-14 07:47:43,346 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:43,347 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:43,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-14 07:47:43,347 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:43,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:43,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1148585766, now seen corresponding path program 1 times [2022-12-14 07:47:43,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:43,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266389375] [2022-12-14 07:47:43,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:43,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:43,925 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:47:43,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:43,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266389375] [2022-12-14 07:47:43,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266389375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:47:43,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:47:43,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:47:43,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071779303] [2022-12-14 07:47:43,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:47:43,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:47:43,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:47:43,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:47:43,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:47:43,926 INFO L87 Difference]: Start difference. First operand 43220 states and 91335 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:44,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:44,733 INFO L93 Difference]: Finished difference Result 44796 states and 94511 transitions. [2022-12-14 07:47:44,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:47:44,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-12-14 07:47:44,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:44,806 INFO L225 Difference]: With dead ends: 44796 [2022-12-14 07:47:44,806 INFO L226 Difference]: Without dead ends: 44796 [2022-12-14 07:47:44,806 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 [2022-12-14 07:47:44,806 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:44,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 86 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 07:47:44,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44796 states. [2022-12-14 07:47:45,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44796 to 44796. [2022-12-14 07:47:45,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44796 states, 44736 states have (on average 2.112638590844063) internal successors, (94511), 44795 states have internal predecessors, (94511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44796 states to 44796 states and 94511 transitions. [2022-12-14 07:47:45,436 INFO L78 Accepts]: Start accepts. Automaton has 44796 states and 94511 transitions. Word has length 51 [2022-12-14 07:47:45,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:45,436 INFO L495 AbstractCegarLoop]: Abstraction has 44796 states and 94511 transitions. [2022-12-14 07:47:45,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 44796 states and 94511 transitions. [2022-12-14 07:47:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-14 07:47:45,437 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:45,437 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:45,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-14 07:47:45,437 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:45,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:45,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1593410272, now seen corresponding path program 1 times [2022-12-14 07:47:45,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:45,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152122744] [2022-12-14 07:47:45,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:45,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:46,022 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:47:46,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:46,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152122744] [2022-12-14 07:47:46,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152122744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:47:46,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:47:46,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:47:46,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102127295] [2022-12-14 07:47:46,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:47:46,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:47:46,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:47:46,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:47:46,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:47:46,023 INFO L87 Difference]: Start difference. First operand 44796 states and 94511 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:46,709 INFO L93 Difference]: Finished difference Result 46776 states and 98760 transitions. [2022-12-14 07:47:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:47:46,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 52 [2022-12-14 07:47:46,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:46,784 INFO L225 Difference]: With dead ends: 46776 [2022-12-14 07:47:46,784 INFO L226 Difference]: Without dead ends: 46736 [2022-12-14 07:47:46,784 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 [2022-12-14 07:47:46,785 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 124 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:46,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 88 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 07:47:46,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46736 states. [2022-12-14 07:47:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46736 to 46616. [2022-12-14 07:47:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46616 states, 46557 states have (on average 2.1133449320188156) internal successors, (98391), 46615 states have internal predecessors, (98391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:47,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46616 states to 46616 states and 98391 transitions. [2022-12-14 07:47:47,441 INFO L78 Accepts]: Start accepts. Automaton has 46616 states and 98391 transitions. Word has length 52 [2022-12-14 07:47:47,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:47,441 INFO L495 AbstractCegarLoop]: Abstraction has 46616 states and 98391 transitions. [2022-12-14 07:47:47,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:47,441 INFO L276 IsEmpty]: Start isEmpty. Operand 46616 states and 98391 transitions. [2022-12-14 07:47:47,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-14 07:47:47,442 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:47,442 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:47,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-14 07:47:47,442 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:47,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:47,442 INFO L85 PathProgramCache]: Analyzing trace with hash 501513220, now seen corresponding path program 1 times [2022-12-14 07:47:47,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:47,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143118769] [2022-12-14 07:47:47,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:47,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:48,045 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:47:48,045 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:48,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143118769] [2022-12-14 07:47:48,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143118769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:47:48,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:47:48,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:47:48,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291214302] [2022-12-14 07:47:48,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:47:48,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:47:48,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:47:48,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:47:48,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:47:48,046 INFO L87 Difference]: Start difference. First operand 46616 states and 98391 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:48,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:48,900 INFO L93 Difference]: Finished difference Result 48615 states and 102341 transitions. [2022-12-14 07:47:48,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:47:48,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-12-14 07:47:48,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:48,994 INFO L225 Difference]: With dead ends: 48615 [2022-12-14 07:47:48,994 INFO L226 Difference]: Without dead ends: 48615 [2022-12-14 07:47:48,995 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 [2022-12-14 07:47:48,995 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 93 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:48,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 87 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 07:47:49,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48615 states. [2022-12-14 07:47:49,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48615 to 48119. [2022-12-14 07:47:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48119 states, 48062 states have (on average 2.108547293079772) internal successors, (101341), 48118 states have internal predecessors, (101341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48119 states to 48119 states and 101341 transitions. [2022-12-14 07:47:49,949 INFO L78 Accepts]: Start accepts. Automaton has 48119 states and 101341 transitions. Word has length 63 [2022-12-14 07:47:49,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:49,949 INFO L495 AbstractCegarLoop]: Abstraction has 48119 states and 101341 transitions. [2022-12-14 07:47:49,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 48119 states and 101341 transitions. [2022-12-14 07:47:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-14 07:47:49,950 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:49,950 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:49,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-14 07:47:49,950 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:49,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:49,951 INFO L85 PathProgramCache]: Analyzing trace with hash 15236230, now seen corresponding path program 1 times [2022-12-14 07:47:49,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:49,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715863857] [2022-12-14 07:47:49,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:49,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:50,619 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:47:50,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:50,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715863857] [2022-12-14 07:47:50,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715863857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:47:50,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:47:50,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:47:50,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502738787] [2022-12-14 07:47:50,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:47:50,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:47:50,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:47:50,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:47:50,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:47:50,620 INFO L87 Difference]: Start difference. First operand 48119 states and 101341 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:51,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:47:51,216 INFO L93 Difference]: Finished difference Result 51423 states and 107920 transitions. [2022-12-14 07:47:51,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:47:51,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 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 69 [2022-12-14 07:47:51,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:47:51,309 INFO L225 Difference]: With dead ends: 51423 [2022-12-14 07:47:51,310 INFO L226 Difference]: Without dead ends: 51362 [2022-12-14 07:47:51,310 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 [2022-12-14 07:47:51,310 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 105 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:47:51,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 84 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 07:47:51,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51362 states. [2022-12-14 07:47:51,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51362 to 49542. [2022-12-14 07:47:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49542 states, 49487 states have (on average 2.0938832420635722) internal successors, (103620), 49541 states have internal predecessors, (103620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49542 states to 49542 states and 103620 transitions. [2022-12-14 07:47:52,028 INFO L78 Accepts]: Start accepts. Automaton has 49542 states and 103620 transitions. Word has length 69 [2022-12-14 07:47:52,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:47:52,028 INFO L495 AbstractCegarLoop]: Abstraction has 49542 states and 103620 transitions. [2022-12-14 07:47:52,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:47:52,028 INFO L276 IsEmpty]: Start isEmpty. Operand 49542 states and 103620 transitions. [2022-12-14 07:47:52,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-14 07:47:52,029 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:47:52,029 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:47:52,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-14 07:47:52,030 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:47:52,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:47:52,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1910323965, now seen corresponding path program 1 times [2022-12-14 07:47:52,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:47:52,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228907539] [2022-12-14 07:47:52,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:52,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:47:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 07:47:54,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:47:54,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228907539] [2022-12-14 07:47:54,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228907539] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:47:54,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271907337] [2022-12-14 07:47:54,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:47:54,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:47:54,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:47:54,546 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:47:54,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 07:47:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:47:55,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 203 conjunts are in the unsatisfiable core [2022-12-14 07:47:55,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:47:55,350 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 07:47:55,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 07:47:55,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:47:55,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:47:55,387 INFO L350 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 14 treesize of output 14 [2022-12-14 07:47:55,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-14 07:47:55,404 INFO L321 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-12-14 07:47:55,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 25 treesize of output 29 [2022-12-14 07:47:55,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-12-14 07:47:55,472 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2022-12-14 07:47:55,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 95 [2022-12-14 07:47:55,496 INFO L321 Elim1Store]: treesize reduction 34, result has 27.7 percent of original size [2022-12-14 07:47:55,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 24 [2022-12-14 07:47:55,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:47:55,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 28 [2022-12-14 07:47:55,541 INFO L321 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-12-14 07:47:55,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 42 [2022-12-14 07:47:55,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:47:55,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 57 [2022-12-14 07:47:55,590 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:47:55,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:47:55,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 31 treesize of output 21 [2022-12-14 07:47:55,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-12-14 07:47:55,767 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2022-12-14 07:47:55,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 82 [2022-12-14 07:47:55,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 07:47:55,801 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-12-14 07:47:55,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 07:47:55,845 INFO L321 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-12-14 07:47:55,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 42 [2022-12-14 07:47:55,860 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 53 [2022-12-14 07:47:55,864 INFO L350 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 17 treesize of output 11 [2022-12-14 07:47:56,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-12-14 07:47:56,044 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2022-12-14 07:47:56,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 82 [2022-12-14 07:47:56,075 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-12-14 07:47:56,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 07:47:56,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 07:47:56,180 INFO L321 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-12-14 07:47:56,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 42 [2022-12-14 07:47:56,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 57 [2022-12-14 07:47:56,235 INFO L350 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 17 treesize of output 11 [2022-12-14 07:47:56,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-12-14 07:47:56,323 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2022-12-14 07:47:56,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 82 [2022-12-14 07:47:56,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 07:47:56,365 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-12-14 07:47:56,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 07:47:56,392 INFO L321 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-12-14 07:47:56,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 42 [2022-12-14 07:47:56,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 57 [2022-12-14 07:47:56,452 INFO L350 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 17 treesize of output 11 [2022-12-14 07:47:56,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:47:56,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:47:56,542 INFO L350 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 18 treesize of output 18 [2022-12-14 07:47:56,561 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 07:47:56,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-12-14 07:47:56,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 07:47:56,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-12-14 07:47:56,682 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2022-12-14 07:47:56,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 82 [2022-12-14 07:47:56,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 07:47:56,730 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-12-14 07:47:56,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2022-12-14 07:47:56,766 INFO L321 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-12-14 07:47:56,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 42 [2022-12-14 07:47:56,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 57 [2022-12-14 07:47:56,824 INFO L350 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 17 treesize of output 11 [2022-12-14 07:47:56,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-12-14 07:47:56,966 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2022-12-14 07:47:56,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 82 [2022-12-14 07:47:57,007 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-12-14 07:47:57,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2022-12-14 07:47:57,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 07:47:57,070 INFO L321 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-12-14 07:47:57,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 42 [2022-12-14 07:47:57,114 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 53 [2022-12-14 07:47:57,123 INFO L350 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 17 treesize of output 11 [2022-12-14 07:47:57,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-12-14 07:47:57,221 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2022-12-14 07:47:57,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 82 [2022-12-14 07:47:57,260 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-12-14 07:47:57,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2022-12-14 07:47:57,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 07:47:57,308 INFO L321 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-12-14 07:47:57,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 42 [2022-12-14 07:47:57,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 53 [2022-12-14 07:47:57,370 INFO L350 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 17 treesize of output 11 [2022-12-14 07:47:57,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-12-14 07:47:57,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:47:57,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:47:57,446 INFO L350 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 18 treesize of output 18 [2022-12-14 07:47:57,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 07:47:57,489 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 07:47:57,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2022-12-14 07:47:57,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:47:57,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 07:47:57,846 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-12-14 07:47:57,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2022-12-14 07:47:57,966 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 07:47:57,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-14 07:47:58,577 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 07:47:58,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 93 [2022-12-14 07:47:59,264 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:47:59,265 INFO L350 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 88 treesize of output 92 [2022-12-14 07:48:00,359 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-12-14 07:48:00,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2022-12-14 07:48:00,462 INFO L321 Elim1Store]: treesize reduction 40, result has 29.8 percent of original size [2022-12-14 07:48:00,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 32 [2022-12-14 07:48:00,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-12-14 07:48:00,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:48:00,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2022-12-14 07:48:00,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:48:00,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:48:00,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 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 [2022-12-14 07:48:00,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:48:00,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:48:00,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:48:00,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 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 [2022-12-14 07:48:00,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 07:48:00,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 07:48:00,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 07:48:00,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 07:48:00,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 07:48:00,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 07:48:01,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 07:48:01,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 07:48:01,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:48:01,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:48:01,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:48:01,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-12-14 07:48:01,183 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 28 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:48:01,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:48:07,694 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:48:07,694 INFO L350 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 71 treesize of output 64 [2022-12-14 07:48:07,703 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:48:07,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 444 treesize of output 392 [2022-12-14 07:48:07,713 INFO L350 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 422 treesize of output 406 [2022-12-14 07:48:07,735 INFO L350 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 238 treesize of output 230 [2022-12-14 07:48:07,900 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:48:07,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 59 [2022-12-14 07:48:07,932 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:48:07,932 INFO L350 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 73 treesize of output 66 [2022-12-14 07:48:07,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:48:07,949 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 07:48:07,949 INFO L350 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 148 treesize of output 126 [2022-12-14 07:48:07,960 INFO L350 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 65 treesize of output 61 [2022-12-14 07:48:07,967 INFO L350 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 162 treesize of output 104 [2022-12-14 07:48:07,999 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:48:07,999 INFO L350 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 73 treesize of output 66 [2022-12-14 07:48:08,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:48:08,013 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 07:48:08,013 INFO L350 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 116 treesize of output 102 [2022-12-14 07:48:08,022 INFO L350 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 [2022-12-14 07:48:08,028 INFO L350 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 116 treesize of output 82 [2022-12-14 07:48:08,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:48:08,064 INFO L350 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 73 treesize of output 66 [2022-12-14 07:48:08,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:48:08,082 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 07:48:08,082 INFO L350 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 116 treesize of output 102 [2022-12-14 07:48:08,093 INFO L350 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 [2022-12-14 07:48:08,102 INFO L350 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 116 treesize of output 82 [2022-12-14 07:48:51,239 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 6 refuted. 9 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:48:51,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271907337] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:48:51,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [274858590] [2022-12-14 07:48:51,239 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 07:48:51,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:48:51,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 27, 18] total 56 [2022-12-14 07:48:51,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357218663] [2022-12-14 07:48:51,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:48:51,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-12-14 07:48:51,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:48:51,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-12-14 07:48:51,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=588, Invalid=2654, Unknown=64, NotChecked=0, Total=3306 [2022-12-14 07:48:51,242 INFO L87 Difference]: Start difference. First operand 49542 states and 103620 transitions. Second operand has 58 states, 57 states have (on average 4.807017543859649) internal successors, (274), 57 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:49:38,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:49:38,342 INFO L93 Difference]: Finished difference Result 190387 states and 397049 transitions. [2022-12-14 07:49:38,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-12-14 07:49:38,343 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 4.807017543859649) internal successors, (274), 57 states have internal predecessors, (274), 0 states have call successors, (0), 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 94 [2022-12-14 07:49:38,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:49:38,750 INFO L225 Difference]: With dead ends: 190387 [2022-12-14 07:49:38,750 INFO L226 Difference]: Without dead ends: 190387 [2022-12-14 07:49:38,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 155 SyntacticMatches, 4 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4270 ImplicationChecksByTransitivity, 52.7s TimeCoverageRelationStatistics Valid=2234, Invalid=10354, Unknown=68, NotChecked=0, Total=12656 [2022-12-14 07:49:38,753 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 3285 mSDsluCounter, 2400 mSDsCounter, 0 mSdLazyCounter, 11842 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3285 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 12114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 11842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.7s IncrementalHoareTripleChecker+Time [2022-12-14 07:49:38,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3285 Valid, 2554 Invalid, 12114 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [272 Valid, 11842 Invalid, 0 Unknown, 0 Unchecked, 42.7s Time] [2022-12-14 07:49:39,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190387 states. [2022-12-14 07:49:40,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190387 to 50604. [2022-12-14 07:49:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50604 states, 50549 states have (on average 2.0919108192051277) internal successors, (105744), 50603 states have internal predecessors, (105744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:49:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50604 states to 50604 states and 105744 transitions. [2022-12-14 07:49:40,419 INFO L78 Accepts]: Start accepts. Automaton has 50604 states and 105744 transitions. Word has length 94 [2022-12-14 07:49:40,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:49:40,419 INFO L495 AbstractCegarLoop]: Abstraction has 50604 states and 105744 transitions. [2022-12-14 07:49:40,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 4.807017543859649) internal successors, (274), 57 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:49:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 50604 states and 105744 transitions. [2022-12-14 07:49:40,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-14 07:49:40,420 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:49:40,420 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:49:40,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 07:49:40,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-14 07:49:40,622 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:49:40,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:49:40,624 INFO L85 PathProgramCache]: Analyzing trace with hash 957800534, now seen corresponding path program 1 times [2022-12-14 07:49:40,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:49:40,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100718158] [2022-12-14 07:49:40,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:49:40,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:49:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:49:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:49:42,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:49:42,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100718158] [2022-12-14 07:49:42,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100718158] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:49:42,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614666288] [2022-12-14 07:49:42,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:49:42,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:49:42,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:49:42,741 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:49:42,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 07:49:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:49:43,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 07:49:43,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:49:43,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 07:49:43,784 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 07:49:43,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 07:49:43,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:49:43,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:49:43,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 07:49:43,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:49:43,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:49:43,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-12-14 07:49:43,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:49:43,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:49:43,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:49:43,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-12-14 07:49:44,070 INFO L350 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 41 treesize of output 37 [2022-12-14 07:49:44,091 INFO L350 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 41 treesize of output 37 [2022-12-14 07:49:44,114 INFO L350 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 41 treesize of output 37 [2022-12-14 07:49:44,140 INFO L350 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 41 treesize of output 37 [2022-12-14 07:49:44,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:49:44,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:49:44,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:49:44,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:49:44,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:49:44,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:49:44,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:49:44,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:49:44,234 INFO L350 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 50 treesize of output 58 [2022-12-14 07:49:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:49:44,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:49:44,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614666288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:49:44,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 07:49:44,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2022-12-14 07:49:44,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984861500] [2022-12-14 07:49:44,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:49:44,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 07:49:44,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:49:44,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 07:49:44,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-12-14 07:49:44,246 INFO L87 Difference]: Start difference. First operand 50604 states and 105744 transitions. Second operand has 13 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:49:46,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:49:46,723 INFO L93 Difference]: Finished difference Result 97258 states and 203319 transitions. [2022-12-14 07:49:46,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 07:49:46,723 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 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 94 [2022-12-14 07:49:46,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:49:46,888 INFO L225 Difference]: With dead ends: 97258 [2022-12-14 07:49:46,888 INFO L226 Difference]: Without dead ends: 97258 [2022-12-14 07:49:46,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2022-12-14 07:49:46,889 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 788 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 1862 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:49:46,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 291 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1862 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-12-14 07:49:46,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97258 states. [2022-12-14 07:49:47,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97258 to 52710. [2022-12-14 07:49:47,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52710 states, 52655 states have (on average 2.089526160858418) internal successors, (110024), 52709 states have internal predecessors, (110024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:49:47,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52710 states to 52710 states and 110024 transitions. [2022-12-14 07:49:47,862 INFO L78 Accepts]: Start accepts. Automaton has 52710 states and 110024 transitions. Word has length 94 [2022-12-14 07:49:47,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:49:47,862 INFO L495 AbstractCegarLoop]: Abstraction has 52710 states and 110024 transitions. [2022-12-14 07:49:47,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:49:47,863 INFO L276 IsEmpty]: Start isEmpty. Operand 52710 states and 110024 transitions. [2022-12-14 07:49:47,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-14 07:49:47,864 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:49:47,864 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:49:47,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 07:49:48,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-14 07:49:48,066 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:49:48,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:49:48,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1181038256, now seen corresponding path program 1 times [2022-12-14 07:49:48,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:49:48,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669564148] [2022-12-14 07:49:48,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:49:48,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:49:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:49:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:49:49,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:49:49,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669564148] [2022-12-14 07:49:49,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669564148] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:49:49,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923434583] [2022-12-14 07:49:49,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:49:49,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:49:49,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:49:49,686 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:49:49,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 07:49:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:49:50,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-14 07:49:50,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:49:51,081 INFO L350 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 15 treesize of output 11 [2022-12-14 07:49:51,115 INFO L350 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 28 treesize of output 27 [2022-12-14 07:49:51,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:49:51,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-12-14 07:49:51,211 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:49:51,211 INFO L350 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 52 treesize of output 57 [2022-12-14 07:49:51,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:49:51,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:49:51,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:49:51,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:49:51,275 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:49:51,275 INFO L350 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 59 treesize of output 67 [2022-12-14 07:49:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:49:51,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:49:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 07:49:52,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923434583] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:49:52,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [659072308] [2022-12-14 07:49:52,519 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 07:49:52,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:49:52,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 9] total 28 [2022-12-14 07:49:52,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145844852] [2022-12-14 07:49:52,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:49:52,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 07:49:52,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:49:52,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 07:49:52,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2022-12-14 07:49:52,521 INFO L87 Difference]: Start difference. First operand 52710 states and 110024 transitions. Second operand has 30 states, 29 states have (on average 7.379310344827586) internal successors, (214), 29 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:50:06,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:50:06,175 INFO L93 Difference]: Finished difference Result 104975 states and 217144 transitions. [2022-12-14 07:50:06,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 07:50:06,175 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 7.379310344827586) internal successors, (214), 29 states have internal predecessors, (214), 0 states have call successors, (0), 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 94 [2022-12-14 07:50:06,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:50:06,379 INFO L225 Difference]: With dead ends: 104975 [2022-12-14 07:50:06,379 INFO L226 Difference]: Without dead ends: 104975 [2022-12-14 07:50:06,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=379, Invalid=1343, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 07:50:06,380 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 2150 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 4868 mSolverCounterSat, 537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2150 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 5405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 537 IncrementalHoareTripleChecker+Valid, 4868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:50:06,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2150 Valid, 622 Invalid, 5405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [537 Valid, 4868 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2022-12-14 07:50:06,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104975 states. [2022-12-14 07:50:07,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104975 to 74926. [2022-12-14 07:50:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74926 states, 74871 states have (on average 2.121582455156202) internal successors, (158845), 74925 states have internal predecessors, (158845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:50:07,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74926 states to 74926 states and 158845 transitions. [2022-12-14 07:50:07,697 INFO L78 Accepts]: Start accepts. Automaton has 74926 states and 158845 transitions. Word has length 94 [2022-12-14 07:50:07,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:50:07,697 INFO L495 AbstractCegarLoop]: Abstraction has 74926 states and 158845 transitions. [2022-12-14 07:50:07,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 7.379310344827586) internal successors, (214), 29 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:50:07,697 INFO L276 IsEmpty]: Start isEmpty. Operand 74926 states and 158845 transitions. [2022-12-14 07:50:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-14 07:50:07,698 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:50:07,698 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:50:07,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 07:50:07,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:50:07,901 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-12-14 07:50:07,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:50:07,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1999116322, now seen corresponding path program 1 times [2022-12-14 07:50:07,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:50:07,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84796455] [2022-12-14 07:50:07,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:50:07,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:50:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:50:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 07:50:10,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:50:10,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84796455] [2022-12-14 07:50:10,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84796455] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:50:10,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139642675] [2022-12-14 07:50:10,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:50:10,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:50:10,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:50:10,463 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:50:10,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9da9df00-b93a-4f03-9b79-a1bb97635069/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 07:50:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:50:11,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 104 conjunts are in the unsatisfiable core [2022-12-14 07:50:11,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:50:11,505 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 07:50:11,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 07:50:11,535 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 07:50:11,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 07:50:11,559 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 07:50:11,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 07:50:11,621 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 07:50:11,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-12-14 07:50:11,715 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 07:50:11,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2022-12-14 07:50:11,837 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-12-14 07:50:11,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2022-12-14 07:50:12,007 INFO L321 Elim1Store]: treesize reduction 90, result has 33.8 percent of original size [2022-12-14 07:50:12,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 69 [2022-12-14 07:50:16,342 INFO L321 Elim1Store]: treesize reduction 108, result has 33.7 percent of original size [2022-12-14 07:50:16,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 42 treesize of output 81 [2022-12-14 07:50:25,085 INFO L321 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2022-12-14 07:50:25,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 47 treesize of output 93 [2022-12-14 07:50:37,501 INFO L321 Elim1Store]: treesize reduction 144, result has 33.6 percent of original size [2022-12-14 07:50:37,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 16 case distinctions, treesize of input 52 treesize of output 105 [2022-12-14 07:50:57,842 INFO L321 Elim1Store]: treesize reduction 162, result has 33.6 percent of original size [2022-12-14 07:50:57,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 57 treesize of output 117 [2022-12-14 07:51:14,410 INFO L321 Elim1Store]: treesize reduction 126, result has 26.7 percent of original size [2022-12-14 07:51:14,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 52 treesize of output 78 [2022-12-14 07:51:14,617 INFO L350 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 15 treesize of output 11 [2022-12-14 07:51:32,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 07:51:33,521 INFO L321 Elim1Store]: treesize reduction 126, result has 26.7 percent of original size [2022-12-14 07:51:33,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 52 treesize of output 78 [2022-12-14 07:51:34,045 INFO L321 Elim1Store]: treesize reduction 36, result has 50.7 percent of original size [2022-12-14 07:51:34,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 67 [2022-12-14 07:51:34,158 INFO L350 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 15 treesize of output 11 [2022-12-14 07:51:34,210 INFO L350 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 28 treesize of output 27 [2022-12-14 07:51:34,272 INFO L350 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 40 treesize of output 42 [2022-12-14 07:51:34,330 INFO L350 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 42 treesize of output 40 [2022-12-14 07:51:34,387 INFO L350 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 52 treesize of output 57 [2022-12-14 07:51:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 11 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:51:34,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:51:34,466 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 4))) (and (forall ((v_ArrVal_23065 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_23065) |c_~#slot~0.base|) (+ .cse0 |c_~#slot~0.offset|)) 0)) (forall ((v_ArrVal_23065 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_23065) |c_~#slot~0.base|) (+ .cse0 |c_~#slot~0.offset| 2)) 0)) (forall ((v_ArrVal_23065 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_23065) |c_~#slot~0.base|) (+ .cse0 |c_~#slot~0.offset| 1)) 0)))) is different from false [2022-12-14 07:51:34,480 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 4))) (let ((.cse1 (+ .cse2 |c_~#slot~0.offset| 2))) (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse1 0)))) (and (forall ((v_ArrVal_23065 (Array Int Int))) (= 0 (select (select (store .cse0 |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_23065) |c_~#slot~0.base|) .cse1))) (forall ((v_ArrVal_23065 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_23065) |c_~#slot~0.base|) (+ .cse2 |c_~#slot~0.offset| 1)) 0)) (forall ((v_ArrVal_23065 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_23065) |c_~#slot~0.base|) (+ .cse2 |c_~#slot~0.offset|)) 0)))))) is different from false [2022-12-14 07:51:34,493 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 4))) (let ((.cse1 (+ .cse2 |c_~#slot~0.offset| 1)) (.cse3 (+ .cse2 |c_~#slot~0.offset| 2))) (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (store (select |c_#race| |c_~#slot~0.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_23065 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_23065) |c_~#slot~0.base|) .cse1) 0)) (forall ((v_ArrVal_23065 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_23065) |c_~#slot~0.base|) (+ .cse2 |c_~#slot~0.offset|)) 0)) (forall ((v_ArrVal_23065 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_23065) |c_~#slot~0.base|) .cse3) 0)))))) is different from false [2022-12-14 07:51:34,505 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:51:34,505 INFO L350 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 43 treesize of output 54 [2022-12-14 07:51:34,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:51:34,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 70 treesize of output 35 [2022-12-14 07:51:34,512 INFO L350 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 3 [2022-12-14 07:51:34,515 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-12-14 07:51:34,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 1 [2022-12-14 07:51:34,518 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-12-14 07:51:34,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 1 [2022-12-14 07:51:34,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2022-12-14 07:51:34,752 INFO L350 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 24 treesize of output 22 [2022-12-14 07:51:37,108 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 54 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-12-14 07:51:37,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139642675] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:51:37,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [339446754] [2022-12-14 07:51:37,108 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-12-14 07:51:37,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:51:37,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20, 18] total 46 [2022-12-14 07:51:37,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922675517] [2022-12-14 07:51:37,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:51:37,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-12-14 07:51:37,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:51:37,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-12-14 07:51:37,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=1504, Unknown=21, NotChecked=264, Total=2256 [2022-12-14 07:51:37,111 INFO L87 Difference]: Start difference. First operand 74926 states and 158845 transitions. Second operand has 48 states, 47 states have (on average 5.531914893617022) internal successors, (260), 47 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:51:46,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:51:52,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:51:58,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:51:59,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:52:12,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:52:15,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:52:17,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:52:29,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:52:31,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:52:45,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:53:15,825 WARN L233 SmtUtils]: Spent 12.28s on a formula simplification. DAG size of input: 124 DAG size of output: 122 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:53:58,194 WARN L233 SmtUtils]: Spent 20.61s on a formula simplification. DAG size of input: 145 DAG size of output: 143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:54:28,605 WARN L233 SmtUtils]: Spent 20.33s on a formula simplification. DAG size of input: 147 DAG size of output: 143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:54:58,347 WARN L233 SmtUtils]: Spent 20.41s on a formula simplification. DAG size of input: 149 DAG size of output: 145 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:55:00,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:55:02,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:55:05,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:55:07,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:55:09,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:55:12,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:55:14,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:55:16,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:55:18,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:55:20,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:55:55,462 WARN L233 SmtUtils]: Spent 7.44s on a formula simplification. DAG size of input: 142 DAG size of output: 138 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:55:57,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:55:58,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:56:00,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:56:03,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:56:05,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:56:43,731 WARN L233 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 148 DAG size of output: 144 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:56:46,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:56:48,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:56:50,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:56:52,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:56:55,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:56:58,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:57:26,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:57:29,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:57:32,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:57:34,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:57:37,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:57:40,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:57:43,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:57:45,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:57:47,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:57:48,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:57:50,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:57:52,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:57:54,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:57:55,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:57:57,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:57:58,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:58:00,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:58:02,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:58:04,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:58:43,692 WARN L233 SmtUtils]: Spent 7.62s on a formula simplification. DAG size of input: 144 DAG size of output: 140 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:58:45,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:58:48,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:58:50,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:58:52,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:58:54,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:58:57,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:58:59,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:00,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:02,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:04,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:06,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:07,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:09,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:11,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:13,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:16,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:19,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:20,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:22,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:24,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:26,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:27,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:29,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:30,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:32,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:34,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:36,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:37,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:39,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:41,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:43,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:44,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:46,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:47,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:49,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:51,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:53,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:54,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:56,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:59:59,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:00:02,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:00:03,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:00:05,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:00:07,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:00:09,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:00:10,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:00:12,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:00:14,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:00:16,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:00:17,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:00:19,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:00:20,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]